./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/05_tas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/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_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-ext/05_tas.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/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_955dae8e-de37-4551-96d5-12642b8fe0ea/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 1ee4025da2c93fbd4be930880192a9e0c94d8979f3d9117e228b55f99542c3b0 --- 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 03:55:17,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:55:17,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:55:17,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:55:17,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:55:17,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:55:17,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:55:17,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:55:17,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:55:17,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:55:17,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:55:17,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:55:17,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:55:17,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:55:17,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:55:17,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:55:17,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:55:17,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:55:17,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:55:17,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:55:17,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:55:17,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:55:17,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:55:17,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:55:17,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:55:17,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:55:17,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:55:17,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:55:17,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:55:17,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:55:17,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:55:17,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:55:17,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:55:17,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:55:17,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:55:17,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:55:17,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:55:17,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:55:17,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:55:17,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:55:17,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:55:17,526 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:55:17,565 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:55:17,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:55:17,566 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:55:17,566 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:55:17,567 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:55:17,568 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:55:17,568 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:55:17,568 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:55:17,569 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:55:17,569 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:55:17,570 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:55:17,571 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:55:17,571 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:55:17,571 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:55:17,572 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:55:17,572 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:55:17,572 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:55:17,573 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:55:17,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:55:17,574 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:55:17,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:55:17,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:55:17,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:55:17,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:55:17,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:55:17,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:55:17,589 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:55:17,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:55:17,590 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:55:17,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:55:17,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:55:17,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:55:17,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:55:17,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:55:17,592 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:55:17,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:55:17,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:55:17,593 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:55:17,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:55:17,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:55:17,594 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:55:17,594 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_955dae8e-de37-4551-96d5-12642b8fe0ea/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_955dae8e-de37-4551-96d5-12642b8fe0ea/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 -> 1ee4025da2c93fbd4be930880192a9e0c94d8979f3d9117e228b55f99542c3b0 [2022-11-03 03:55:17,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:55:17,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:55:17,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:55:17,961 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:55:17,962 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:55:17,963 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread-ext/05_tas.i [2022-11-03 03:55:18,043 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/data/098bf0de9/fdf800072e514550b12b4dbed033fed3/FLAG7a10c244a [2022-11-03 03:55:18,582 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:55:18,588 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/sv-benchmarks/c/pthread-ext/05_tas.i [2022-11-03 03:55:18,608 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/data/098bf0de9/fdf800072e514550b12b4dbed033fed3/FLAG7a10c244a [2022-11-03 03:55:18,902 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/data/098bf0de9/fdf800072e514550b12b4dbed033fed3 [2022-11-03 03:55:18,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:55:18,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:55:18,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:55:18,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:55:18,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:55:18,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:55:18" (1/1) ... [2022-11-03 03:55:18,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce59274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:18, skipping insertion in model container [2022-11-03 03:55:18,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:55:18" (1/1) ... [2022-11-03 03:55:18,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:55:18,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:55:19,524 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_955dae8e-de37-4551-96d5-12642b8fe0ea/sv-benchmarks/c/pthread-ext/05_tas.i[30203,30216] [2022-11-03 03:55:19,532 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_955dae8e-de37-4551-96d5-12642b8fe0ea/sv-benchmarks/c/pthread-ext/05_tas.i[30300,30313] [2022-11-03 03:55:19,537 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_955dae8e-de37-4551-96d5-12642b8fe0ea/sv-benchmarks/c/pthread-ext/05_tas.i[30446,30459] [2022-11-03 03:55:19,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:55:19,550 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:55:19,583 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_955dae8e-de37-4551-96d5-12642b8fe0ea/sv-benchmarks/c/pthread-ext/05_tas.i[30203,30216] [2022-11-03 03:55:19,584 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_955dae8e-de37-4551-96d5-12642b8fe0ea/sv-benchmarks/c/pthread-ext/05_tas.i[30300,30313] [2022-11-03 03:55:19,585 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_955dae8e-de37-4551-96d5-12642b8fe0ea/sv-benchmarks/c/pthread-ext/05_tas.i[30446,30459] [2022-11-03 03:55:19,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:55:19,622 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:55:19,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:19 WrapperNode [2022-11-03 03:55:19,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:55:19,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:55:19,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:55:19,625 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:55:19,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:19" (1/1) ... [2022-11-03 03:55:19,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:19" (1/1) ... [2022-11-03 03:55:19,707 INFO L138 Inliner]: procedures = 169, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 93 [2022-11-03 03:55:19,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:55:19,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:55:19,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:55:19,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:55:19,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:19" (1/1) ... [2022-11-03 03:55:19,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:19" (1/1) ... [2022-11-03 03:55:19,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:19" (1/1) ... [2022-11-03 03:55:19,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:19" (1/1) ... [2022-11-03 03:55:19,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:19" (1/1) ... [2022-11-03 03:55:19,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:19" (1/1) ... [2022-11-03 03:55:19,757 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:19" (1/1) ... [2022-11-03 03:55:19,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:19" (1/1) ... [2022-11-03 03:55:19,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:55:19,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:55:19,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:55:19,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:55:19,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:19" (1/1) ... [2022-11-03 03:55:19,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:55:19,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:55:19,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:55:19,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:55:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:55:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-03 03:55:19,857 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-03 03:55:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:55:19,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:55:19,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:55:19,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:55:19,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:55:19,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:55:19,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:55:19,860 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 03:55:20,023 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:55:20,025 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:55:20,271 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:55:20,326 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:55:20,326 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-03 03:55:20,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:55:20 BoogieIcfgContainer [2022-11-03 03:55:20,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:55:20,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:55:20,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:55:20,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:55:20,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:55:18" (1/3) ... [2022-11-03 03:55:20,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5c0331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:55:20, skipping insertion in model container [2022-11-03 03:55:20,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:19" (2/3) ... [2022-11-03 03:55:20,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5c0331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:55:20, skipping insertion in model container [2022-11-03 03:55:20,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:55:20" (3/3) ... [2022-11-03 03:55:20,337 INFO L112 eAbstractionObserver]: Analyzing ICFG 05_tas.i [2022-11-03 03:55:20,346 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 03:55:20,356 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:55:20,357 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-11-03 03:55:20,357 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 03:55:20,460 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 03:55:20,544 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:55:20,567 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 91 transitions, 187 flow [2022-11-03 03:55:20,579 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 91 transitions, 187 flow [2022-11-03 03:55:20,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 91 transitions, 187 flow [2022-11-03 03:55:20,648 INFO L130 PetriNetUnfolder]: 10/102 cut-off events. [2022-11-03 03:55:20,648 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-03 03:55:20,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 102 events. 10/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 127 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 72. Up to 4 conditions per place. [2022-11-03 03:55:20,656 INFO L118 LiptonReduction]: Number of co-enabled transitions 1652 [2022-11-03 03:55:23,799 INFO L133 LiptonReduction]: Checked pairs total: 1744 [2022-11-03 03:55:23,800 INFO L135 LiptonReduction]: Total number of compositions: 95 [2022-11-03 03:55:23,809 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 21 transitions, 47 flow [2022-11-03 03:55:23,834 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 62 states, 55 states have (on average 2.2545454545454544) internal successors, (124), 61 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:23,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:55:23,866 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;@23f1c5fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:55:23,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-03 03:55:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 55 states have (on average 2.2545454545454544) internal successors, (124), 61 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 03:55:23,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:23,884 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2022-11-03 03:55:23,885 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 03:55:23,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:23,894 INFO L85 PathProgramCache]: Analyzing trace with hash 445169088, now seen corresponding path program 1 times [2022-11-03 03:55:23,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:55:23,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915121811] [2022-11-03 03:55:23,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:23,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:55:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:55:24,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 03:55:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:55:24,110 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 03:55:24,112 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 03:55:24,114 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2022-11-03 03:55:24,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-03 03:55:24,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2022-11-03 03:55:24,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-11-03 03:55:24,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-11-03 03:55:24,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-11-03 03:55:24,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-03 03:55:24,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:55:24,122 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-03 03:55:24,126 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-03 03:55:24,126 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-03 03:55:24,195 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 03:55:24,202 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:55:24,203 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 151 transitions, 314 flow [2022-11-03 03:55:24,203 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 151 transitions, 314 flow [2022-11-03 03:55:24,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 151 transitions, 314 flow [2022-11-03 03:55:24,295 INFO L130 PetriNetUnfolder]: 19/175 cut-off events. [2022-11-03 03:55:24,295 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-03 03:55:24,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 19/175 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 405 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 131. Up to 6 conditions per place. [2022-11-03 03:55:24,315 INFO L118 LiptonReduction]: Number of co-enabled transitions 10384 [2022-11-03 03:55:27,236 INFO L133 LiptonReduction]: Checked pairs total: 18581 [2022-11-03 03:55:27,237 INFO L135 LiptonReduction]: Total number of compositions: 139 [2022-11-03 03:55:27,238 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 59 transitions, 130 flow [2022-11-03 03:55:27,330 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2501 states, 2467 states have (on average 3.3838670449939197) internal successors, (8348), 2500 states have internal predecessors, (8348), 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 03:55:27,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:55:27,333 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;@23f1c5fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:55:27,333 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-03 03:55:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 2501 states, 2467 states have (on average 3.3838670449939197) internal successors, (8348), 2500 states have internal predecessors, (8348), 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 03:55:27,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:55:27,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:27,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:55:27,344 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-03 03:55:27,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:27,345 INFO L85 PathProgramCache]: Analyzing trace with hash 2131479148, now seen corresponding path program 1 times [2022-11-03 03:55:27,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:55:27,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010720795] [2022-11-03 03:55:27,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:27,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:55:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:27,489 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 03:55:27,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:55:27,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010720795] [2022-11-03 03:55:27,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010720795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:55:27,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:55:27,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:55:27,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025672846] [2022-11-03 03:55:27,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:55:27,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 03:55:27,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:55:27,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 03:55:27,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 03:55:27,546 INFO L87 Difference]: Start difference. First operand has 2501 states, 2467 states have (on average 3.3838670449939197) internal successors, (8348), 2500 states have internal predecessors, (8348), 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 03:55:27,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:55:27,681 INFO L93 Difference]: Finished difference Result 1884 states and 5597 transitions. [2022-11-03 03:55:27,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 03:55:27,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-11-03 03:55:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:55:27,736 INFO L225 Difference]: With dead ends: 1884 [2022-11-03 03:55:27,739 INFO L226 Difference]: Without dead ends: 1884 [2022-11-03 03:55:27,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 03:55:27,751 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:55:27,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:55:27,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2022-11-03 03:55:27,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1884. [2022-11-03 03:55:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1875 states have (on average 2.9850666666666665) internal successors, (5597), 1883 states have internal predecessors, (5597), 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 03:55:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 5597 transitions. [2022-11-03 03:55:27,942 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 5597 transitions. Word has length 8 [2022-11-03 03:55:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:55:27,943 INFO L495 AbstractCegarLoop]: Abstraction has 1884 states and 5597 transitions. [2022-11-03 03:55:27,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 03:55:27,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 5597 transitions. [2022-11-03 03:55:27,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:55:27,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:27,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:55:27,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:55:27,946 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-03 03:55:27,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:27,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1651323105, now seen corresponding path program 1 times [2022-11-03 03:55:27,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:55:27,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491631737] [2022-11-03 03:55:27,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:27,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:55:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:28,240 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 03:55:28,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:55:28,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491631737] [2022-11-03 03:55:28,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491631737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:55:28,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:55:28,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:55:28,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411907527] [2022-11-03 03:55:28,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:55:28,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:55:28,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:55:28,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:55:28,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:55:28,243 INFO L87 Difference]: Start difference. First operand 1884 states and 5597 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:55:28,721 INFO L93 Difference]: Finished difference Result 3126 states and 9049 transitions. [2022-11-03 03:55:28,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:55:28,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 03:55:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:55:28,741 INFO L225 Difference]: With dead ends: 3126 [2022-11-03 03:55:28,741 INFO L226 Difference]: Without dead ends: 3126 [2022-11-03 03:55:28,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:55:28,743 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 84 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:55:28,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 80 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:55:28,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2022-11-03 03:55:28,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 2518. [2022-11-03 03:55:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2509 states have (on average 2.9736946990833) internal successors, (7461), 2517 states have internal predecessors, (7461), 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 03:55:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 7461 transitions. [2022-11-03 03:55:28,839 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 7461 transitions. Word has length 9 [2022-11-03 03:55:28,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:55:28,840 INFO L495 AbstractCegarLoop]: Abstraction has 2518 states and 7461 transitions. [2022-11-03 03:55:28,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 7461 transitions. [2022-11-03 03:55:28,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:55:28,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:28,841 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-11-03 03:55:28,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:55:28,841 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-03 03:55:28,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:28,842 INFO L85 PathProgramCache]: Analyzing trace with hash 137087969, now seen corresponding path program 1 times [2022-11-03 03:55:28,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:55:28,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220402420] [2022-11-03 03:55:28,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:28,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:55:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:55:28,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 03:55:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:55:28,896 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 03:55:28,897 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 03:55:28,897 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2022-11-03 03:55:28,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (8 of 10 remaining) [2022-11-03 03:55:28,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2022-11-03 03:55:28,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (6 of 10 remaining) [2022-11-03 03:55:28,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 10 remaining) [2022-11-03 03:55:28,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 10 remaining) [2022-11-03 03:55:28,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (3 of 10 remaining) [2022-11-03 03:55:28,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 10 remaining) [2022-11-03 03:55:28,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2022-11-03 03:55:28,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2022-11-03 03:55:28,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:55:28,902 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-03 03:55:28,903 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-03 03:55:28,903 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-03 03:55:28,989 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 03:55:28,995 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:55:28,995 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 211 transitions, 443 flow [2022-11-03 03:55:28,996 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 211 transitions, 443 flow [2022-11-03 03:55:28,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 211 transitions, 443 flow [2022-11-03 03:55:29,077 INFO L130 PetriNetUnfolder]: 28/248 cut-off events. [2022-11-03 03:55:29,077 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-03 03:55:29,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 248 events. 28/248 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 751 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 190. Up to 8 conditions per place. [2022-11-03 03:55:29,101 INFO L118 LiptonReduction]: Number of co-enabled transitions 26196 [2022-11-03 03:55:33,276 INFO L133 LiptonReduction]: Checked pairs total: 55655 [2022-11-03 03:55:33,277 INFO L135 LiptonReduction]: Total number of compositions: 187 [2022-11-03 03:55:33,278 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 84 transitions, 189 flow [2022-11-03 03:55:35,437 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 50100 states, 49955 states have (on average 4.546471824642178) internal successors, (227119), 50099 states have internal predecessors, (227119), 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 03:55:35,438 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:55:35,439 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;@23f1c5fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:55:35,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-03 03:55:35,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 50100 states, 49955 states have (on average 4.546471824642178) internal successors, (227119), 50099 states have internal predecessors, (227119), 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 03:55:35,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:55:35,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:35,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:55:35,689 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2022-11-03 03:55:35,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:35,692 INFO L85 PathProgramCache]: Analyzing trace with hash -669766325, now seen corresponding path program 1 times [2022-11-03 03:55:35,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:55:35,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476927250] [2022-11-03 03:55:35,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:35,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:55:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:35,733 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 03:55:35,733 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:55:35,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476927250] [2022-11-03 03:55:35,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476927250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:55:35,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:55:35,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:55:35,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762929919] [2022-11-03 03:55:35,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:55:35,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 03:55:35,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:55:35,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 03:55:35,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 03:55:35,823 INFO L87 Difference]: Start difference. First operand has 50100 states, 49955 states have (on average 4.546471824642178) internal successors, (227119), 50099 states have internal predecessors, (227119), 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 03:55:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:55:37,293 INFO L93 Difference]: Finished difference Result 35818 states and 145950 transitions. [2022-11-03 03:55:37,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 03:55:37,293 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-11-03 03:55:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:55:37,826 INFO L225 Difference]: With dead ends: 35818 [2022-11-03 03:55:37,827 INFO L226 Difference]: Without dead ends: 35818 [2022-11-03 03:55:37,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 03:55:37,828 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:55:37,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:55:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35818 states. [2022-11-03 03:55:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35818 to 35818. [2022-11-03 03:55:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35818 states, 35791 states have (on average 4.077840797965969) internal successors, (145950), 35817 states have internal predecessors, (145950), 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 03:55:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35818 states to 35818 states and 145950 transitions. [2022-11-03 03:55:40,640 INFO L78 Accepts]: Start accepts. Automaton has 35818 states and 145950 transitions. Word has length 8 [2022-11-03 03:55:40,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:55:40,641 INFO L495 AbstractCegarLoop]: Abstraction has 35818 states and 145950 transitions. [2022-11-03 03:55:40,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 03:55:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 35818 states and 145950 transitions. [2022-11-03 03:55:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:55:40,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:40,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:55:40,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:55:40,657 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2022-11-03 03:55:40,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:40,658 INFO L85 PathProgramCache]: Analyzing trace with hash 712043268, now seen corresponding path program 1 times [2022-11-03 03:55:40,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:55:40,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49015214] [2022-11-03 03:55:40,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:40,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:55:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:40,843 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 03:55:40,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:55:40,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49015214] [2022-11-03 03:55:40,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49015214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:55:40,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:55:40,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:55:40,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615492785] [2022-11-03 03:55:40,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:55:40,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:55:40,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:55:40,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:55:40,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:55:40,846 INFO L87 Difference]: Start difference. First operand 35818 states and 145950 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:55:42,425 INFO L93 Difference]: Finished difference Result 66340 states and 260342 transitions. [2022-11-03 03:55:42,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:55:42,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 03:55:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:55:42,927 INFO L225 Difference]: With dead ends: 66340 [2022-11-03 03:55:42,928 INFO L226 Difference]: Without dead ends: 66340 [2022-11-03 03:55:42,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:55:42,929 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 200 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:55:42,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 125 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:55:43,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66340 states. [2022-11-03 03:55:45,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66340 to 57455. [2022-11-03 03:55:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57455 states, 57428 states have (on average 3.9786167026537576) internal successors, (228484), 57454 states have internal predecessors, (228484), 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 03:55:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57455 states to 57455 states and 228484 transitions. [2022-11-03 03:55:46,201 INFO L78 Accepts]: Start accepts. Automaton has 57455 states and 228484 transitions. Word has length 9 [2022-11-03 03:55:46,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:55:46,204 INFO L495 AbstractCegarLoop]: Abstraction has 57455 states and 228484 transitions. [2022-11-03 03:55:46,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:55:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 57455 states and 228484 transitions. [2022-11-03 03:55:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:55:46,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:46,206 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:55:46,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:55:46,207 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2022-11-03 03:55:46,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:46,208 INFO L85 PathProgramCache]: Analyzing trace with hash 15409602, now seen corresponding path program 1 times [2022-11-03 03:55:46,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:55:46,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046744595] [2022-11-03 03:55:46,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:46,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:55:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:55:46,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:55:46,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046744595] [2022-11-03 03:55:46,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046744595] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:55:46,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034655639] [2022-11-03 03:55:46,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:46,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:55:46,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:55:46,554 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:55:46,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:55:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:46,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 03:55:46,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:55:46,761 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 03:55:46,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 03:55:46,902 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-03 03:55:46,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-03 03:55:46,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 03:55:46,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 03:55:47,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-11-03 03:55:47,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:55:47,190 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 03:55:47,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 36 [2022-11-03 03:55:47,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-11-03 03:55:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:55:47,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:55:47,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034655639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:55:47,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:55:47,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2022-11-03 03:55:47,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012761194] [2022-11-03 03:55:47,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:55:47,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:55:47,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:55:47,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:55:47,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-03 03:55:47,236 INFO L87 Difference]: Start difference. First operand 57455 states and 228484 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 03:55:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:55:49,169 INFO L93 Difference]: Finished difference Result 90864 states and 368025 transitions. [2022-11-03 03:55:49,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:55:49,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2022-11-03 03:55:49,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:55:50,660 INFO L225 Difference]: With dead ends: 90864 [2022-11-03 03:55:50,660 INFO L226 Difference]: Without dead ends: 90864 [2022-11-03 03:55:50,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:55:50,661 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 123 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:55:50,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 168 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 330 Invalid, 0 Unknown, 131 Unchecked, 1.1s Time] [2022-11-03 03:55:50,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90864 states. [2022-11-03 03:55:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90864 to 64262. [2022-11-03 03:55:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64262 states, 64235 states have (on average 4.0185257258503935) internal successors, (258130), 64261 states have internal predecessors, (258130), 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 03:55:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64262 states to 64262 states and 258130 transitions. [2022-11-03 03:55:53,849 INFO L78 Accepts]: Start accepts. Automaton has 64262 states and 258130 transitions. Word has length 12 [2022-11-03 03:55:53,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:55:53,850 INFO L495 AbstractCegarLoop]: Abstraction has 64262 states and 258130 transitions. [2022-11-03 03:55:53,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 03:55:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 64262 states and 258130 transitions. [2022-11-03 03:55:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:55:53,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:55:53,852 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:55:53,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:55:54,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:55:54,056 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2022-11-03 03:55:54,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:55:54,057 INFO L85 PathProgramCache]: Analyzing trace with hash 15435642, now seen corresponding path program 2 times [2022-11-03 03:55:54,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:55:54,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611790986] [2022-11-03 03:55:54,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:55:54,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:55:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:55:54,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:55:54,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:55:54,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611790986] [2022-11-03 03:55:54,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611790986] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:55:54,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345694786] [2022-11-03 03:55:54,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:55:54,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:55:54,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:55:54,534 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:55:54,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:55:54,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:55:54,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:55:54,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 03:55:54,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:55:54,692 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:55:54,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 03:55:54,821 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 03:55:54,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 03:55:54,891 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-03 03:55:54,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-03 03:55:54,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 03:55:54,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 03:55:54,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:55:55,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-11-03 03:55:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:55:55,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:55:55,176 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_129 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_129))) (= (select (select .cse0 |c_~#lock~0.base|) |c_~#lock~0.offset|) (select (select .cse0 |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base|) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.offset|))))) is different from false [2022-11-03 03:55:55,267 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:55:55,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1012 treesize of output 980 [2022-11-03 03:55:55,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 945 treesize of output 921 [2022-11-03 03:55:55,389 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:55:55,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 762 treesize of output 691 [2022-11-03 03:55:55,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 932 treesize of output 916 [2022-11-03 03:55:56,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:55:56,532 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-03 03:55:56,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2022-11-03 03:55:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 03:55:56,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345694786] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:55:56,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [629230473] [2022-11-03 03:55:56,667 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:55:56,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:55:56,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-11-03 03:55:56,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239097087] [2022-11-03 03:55:56,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:55:56,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 03:55:56,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:55:56,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 03:55:56,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=213, Unknown=6, NotChecked=30, Total=306 [2022-11-03 03:55:56,672 INFO L87 Difference]: Start difference. First operand 64262 states and 258130 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 17 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 03:55:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:55:59,359 INFO L93 Difference]: Finished difference Result 112852 states and 460152 transitions. [2022-11-03 03:55:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 03:55:59,360 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 17 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) Word has length 12 [2022-11-03 03:55:59,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:55:59,991 INFO L225 Difference]: With dead ends: 112852 [2022-11-03 03:55:59,992 INFO L226 Difference]: Without dead ends: 112852 [2022-11-03 03:55:59,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=409, Unknown=7, NotChecked=44, Total=600 [2022-11-03 03:55:59,993 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 477 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 638 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:55:59,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 322 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 642 Invalid, 0 Unknown, 638 Unchecked, 0.7s Time] [2022-11-03 03:56:00,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112852 states. [2022-11-03 03:56:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112852 to 84629. [2022-11-03 03:56:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84629 states, 84602 states have (on average 4.114323538450628) internal successors, (348080), 84628 states have internal predecessors, (348080), 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 03:56:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84629 states to 84629 states and 348080 transitions. [2022-11-03 03:56:03,960 INFO L78 Accepts]: Start accepts. Automaton has 84629 states and 348080 transitions. Word has length 12 [2022-11-03 03:56:03,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:03,960 INFO L495 AbstractCegarLoop]: Abstraction has 84629 states and 348080 transitions. [2022-11-03 03:56:03,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 17 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 03:56:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 84629 states and 348080 transitions. [2022-11-03 03:56:03,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:56:03,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:03,962 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:03,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:04,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:04,170 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2022-11-03 03:56:04,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:04,170 INFO L85 PathProgramCache]: Analyzing trace with hash 477693695, now seen corresponding path program 1 times [2022-11-03 03:56:04,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:56:04,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556137115] [2022-11-03 03:56:04,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:04,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:56:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:04,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:56:04,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556137115] [2022-11-03 03:56:04,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556137115] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:56:04,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329474337] [2022-11-03 03:56:04,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:04,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:04,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:56:04,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:56:04,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:56:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:04,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 03:56:04,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:04,562 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 03:56:04,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 03:56:04,666 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-03 03:56:04,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-03 03:56:04,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 03:56:04,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 03:56:04,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-11-03 03:56:04,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:56:04,927 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 03:56:04,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 36 [2022-11-03 03:56:04,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-11-03 03:56:04,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:04,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:56:04,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_162 (Array Int Int))) (not (= |c_thr1Thread1of3ForFork0_acquire_lock_#t~mem5#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_162) |c_~#lock~0.base|) |c_~#lock~0.offset|)))) is different from false [2022-11-03 03:56:04,993 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_162 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_162) |c_~#lock~0.base|) |c_~#lock~0.offset|) (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base|) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.offset|)))) is different from false [2022-11-03 03:56:05,009 WARN L833 $PredicateComparison]: unable to prove that (forall ((|thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| Int) (|thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.offset| Int)) (let ((.cse0 (select (select |c_#memory_int| |thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base|) |thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.offset|))) (or (= .cse0 1) (forall ((v_ArrVal_162 (Array Int Int))) (not (= .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_162) |c_~#lock~0.base|) |c_~#lock~0.offset|))))))) is different from false [2022-11-03 03:56:05,037 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:56:05,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 400 treesize of output 386 [2022-11-03 03:56:05,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 428 treesize of output 416 [2022-11-03 03:56:05,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 308 treesize of output 288 [2022-11-03 03:56:05,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 333 treesize of output 323 [2022-11-03 03:56:05,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-11-03 03:56:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 03:56:05,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329474337] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:56:05,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1173215652] [2022-11-03 03:56:05,955 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:56:05,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:56:05,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-11-03 03:56:05,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107528842] [2022-11-03 03:56:05,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:56:05,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 03:56:05,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:56:05,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 03:56:05,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=110, Unknown=3, NotChecked=72, Total=240 [2022-11-03 03:56:05,975 INFO L87 Difference]: Start difference. First operand 84629 states and 348080 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 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 03:56:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:09,584 INFO L93 Difference]: Finished difference Result 125737 states and 512759 transitions. [2022-11-03 03:56:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:56:09,585 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 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 13 [2022-11-03 03:56:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:10,429 INFO L225 Difference]: With dead ends: 125737 [2022-11-03 03:56:10,430 INFO L226 Difference]: Without dead ends: 125737 [2022-11-03 03:56:10,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=155, Unknown=3, NotChecked=90, Total=342 [2022-11-03 03:56:10,431 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 322 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 831 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:10,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 222 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 760 Invalid, 0 Unknown, 831 Unchecked, 0.7s Time] [2022-11-03 03:56:10,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125737 states. [2022-11-03 03:56:13,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125737 to 82781. [2022-11-03 03:56:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82781 states, 82754 states have (on average 4.089687507552505) internal successors, (338438), 82780 states have internal predecessors, (338438), 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 03:56:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82781 states to 82781 states and 338438 transitions. [2022-11-03 03:56:14,350 INFO L78 Accepts]: Start accepts. Automaton has 82781 states and 338438 transitions. Word has length 13 [2022-11-03 03:56:14,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:14,350 INFO L495 AbstractCegarLoop]: Abstraction has 82781 states and 338438 transitions. [2022-11-03 03:56:14,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 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 03:56:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 82781 states and 338438 transitions. [2022-11-03 03:56:14,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:56:14,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:14,352 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:14,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:14,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:14,561 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2022-11-03 03:56:14,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:14,561 INFO L85 PathProgramCache]: Analyzing trace with hash 478500935, now seen corresponding path program 2 times [2022-11-03 03:56:14,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:56:14,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613275646] [2022-11-03 03:56:14,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:14,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:56:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:15,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:56:15,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613275646] [2022-11-03 03:56:15,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613275646] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:56:15,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116652542] [2022-11-03 03:56:15,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:56:15,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:15,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:56:15,021 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:56:15,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:56:15,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:56:15,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:56:15,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 03:56:15,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:15,165 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:56:15,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 03:56:15,277 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 03:56:15,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 03:56:15,349 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-03 03:56:15,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-03 03:56:15,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 03:56:15,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 03:56:15,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:56:15,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-11-03 03:56:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:15,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:56:15,630 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_196 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_196))) (= (select (select .cse0 |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base|) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.offset|) (select (select .cse0 |c_~#lock~0.base|) |c_~#lock~0.offset|))))) is different from false [2022-11-03 03:56:15,643 WARN L833 $PredicateComparison]: unable to prove that (forall ((|thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.offset| Int)) (or (forall ((v_ArrVal_196 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_196))) (= (select (select .cse0 |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base|) |thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.offset|) (select (select .cse0 |c_~#lock~0.base|) |c_~#lock~0.offset|))))) (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base|) |thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.offset|) 1))) is different from false [2022-11-03 03:56:15,672 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:56:15,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 672 treesize of output 658 [2022-11-03 03:56:15,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 700 treesize of output 688 [2022-11-03 03:56:15,746 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:56:15,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 580 treesize of output 521 [2022-11-03 03:56:15,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 557 treesize of output 547 [2022-11-03 03:56:16,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:56:16,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-11-03 03:56:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 03:56:16,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116652542] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:56:16,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1319477075] [2022-11-03 03:56:16,223 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:56:16,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:56:16,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-11-03 03:56:16,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969117419] [2022-11-03 03:56:16,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:56:16,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 03:56:16,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:56:16,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 03:56:16,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=196, Unknown=2, NotChecked=58, Total=306 [2022-11-03 03:56:16,228 INFO L87 Difference]: Start difference. First operand 82781 states and 338438 transitions. Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 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 03:56:20,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:20,898 INFO L93 Difference]: Finished difference Result 125847 states and 514964 transitions. [2022-11-03 03:56:20,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 03:56:20,899 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 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 13 [2022-11-03 03:56:20,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:21,693 INFO L225 Difference]: With dead ends: 125847 [2022-11-03 03:56:21,693 INFO L226 Difference]: Without dead ends: 125847 [2022-11-03 03:56:21,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=683, Unknown=11, NotChecked=114, Total=992 [2022-11-03 03:56:21,694 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 814 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1325 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:21,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 568 Invalid, 3050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1549 Invalid, 0 Unknown, 1325 Unchecked, 2.2s Time] [2022-11-03 03:56:21,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125847 states. [2022-11-03 03:56:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125847 to 89032. [2022-11-03 03:56:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89032 states, 89005 states have (on average 4.1239930340992075) internal successors, (367056), 89031 states have internal predecessors, (367056), 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 03:56:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89032 states to 89032 states and 367056 transitions. [2022-11-03 03:56:25,774 INFO L78 Accepts]: Start accepts. Automaton has 89032 states and 367056 transitions. Word has length 13 [2022-11-03 03:56:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:25,775 INFO L495 AbstractCegarLoop]: Abstraction has 89032 states and 367056 transitions. [2022-11-03 03:56:25,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 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 03:56:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 89032 states and 367056 transitions. [2022-11-03 03:56:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:56:25,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:25,776 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:25,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:25,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_955dae8e-de37-4551-96d5-12642b8fe0ea/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:25,977 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2022-11-03 03:56:25,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:25,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1701133639, now seen corresponding path program 1 times [2022-11-03 03:56:25,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:56:25,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024019435] [2022-11-03 03:56:25,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:25,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:56:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:26,088 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 03:56:26,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:56:26,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024019435] [2022-11-03 03:56:26,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024019435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:56:26,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:56:26,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:56:26,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136159851] [2022-11-03 03:56:26,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:56:26,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:56:26,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:56:26,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:56:26,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:56:26,092 INFO L87 Difference]: Start difference. First operand 89032 states and 367056 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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)