./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/34_double_lock_p2_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/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_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-ext/34_double_lock_p2_vs.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/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_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/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 92ecee121b9ddff062603596761b7b6e384463e9908bd9593577f02dd4911207 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:34:40,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:34:40,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:34:40,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:34:40,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:34:40,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:34:40,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:34:40,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:34:40,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:34:40,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:34:40,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:34:40,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:34:40,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:34:40,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:34:40,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:34:40,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:34:40,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:34:40,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:34:40,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:34:40,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:34:40,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:34:40,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:34:40,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:34:40,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:34:40,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:34:40,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:34:40,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:34:40,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:34:40,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:34:40,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:34:40,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:34:40,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:34:40,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:34:40,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:34:40,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:34:40,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:34:40,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:34:40,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:34:40,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:34:40,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:34:40,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:34:40,452 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:34:40,502 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:34:40,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:34:40,503 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:34:40,503 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:34:40,504 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:34:40,504 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:34:40,504 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:34:40,504 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:34:40,505 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:34:40,505 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:34:40,505 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:34:40,505 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:34:40,505 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:34:40,506 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:34:40,506 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:34:40,506 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:34:40,506 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:34:40,506 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:34:40,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:34:40,507 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:34:40,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:34:40,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:34:40,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:34:40,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:34:40,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:34:40,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:34:40,508 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:34:40,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:34:40,509 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:34:40,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:34:40,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:34:40,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:34:40,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:34:40,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:34:40,510 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:34:40,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:34:40,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:34:40,510 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:34:40,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:34:40,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:34:40,514 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:34:40,514 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_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/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_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/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 -> 92ecee121b9ddff062603596761b7b6e384463e9908bd9593577f02dd4911207 [2022-11-03 02:34:40,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:34:40,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:34:40,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:34:40,794 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:34:40,795 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:34:40,797 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread-ext/34_double_lock_p2_vs.i [2022-11-03 02:34:40,861 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/bin/utaipan-7li7fVZpFI/data/a1c7566df/56675e78f8c949309f198e3962dd6071/FLAG46350b39a [2022-11-03 02:34:41,307 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:34:41,308 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/sv-benchmarks/c/pthread-ext/34_double_lock_p2_vs.i [2022-11-03 02:34:41,327 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/bin/utaipan-7li7fVZpFI/data/a1c7566df/56675e78f8c949309f198e3962dd6071/FLAG46350b39a [2022-11-03 02:34:41,642 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/bin/utaipan-7li7fVZpFI/data/a1c7566df/56675e78f8c949309f198e3962dd6071 [2022-11-03 02:34:41,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:34:41,646 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:34:41,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:34:41,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:34:41,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:34:41,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:34:41" (1/1) ... [2022-11-03 02:34:41,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5c06e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:34:41, skipping insertion in model container [2022-11-03 02:34:41,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:34:41" (1/1) ... [2022-11-03 02:34:41,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:34:41,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:34:42,201 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_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/sv-benchmarks/c/pthread-ext/34_double_lock_p2_vs.i[30847,30860] [2022-11-03 02:34:42,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:34:42,227 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:34:42,274 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_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/sv-benchmarks/c/pthread-ext/34_double_lock_p2_vs.i[30847,30860] [2022-11-03 02:34:42,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:34:42,329 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:34:42,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:34:42 WrapperNode [2022-11-03 02:34:42,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:34:42,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:34:42,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:34:42,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:34:42,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:34:42" (1/1) ... [2022-11-03 02:34:42,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:34:42" (1/1) ... [2022-11-03 02:34:42,413 INFO L138 Inliner]: procedures = 175, calls = 36, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 157 [2022-11-03 02:34:42,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:34:42,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:34:42,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:34:42,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:34:42,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:34:42" (1/1) ... [2022-11-03 02:34:42,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:34:42" (1/1) ... [2022-11-03 02:34:42,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:34:42" (1/1) ... [2022-11-03 02:34:42,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:34:42" (1/1) ... [2022-11-03 02:34:42,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:34:42" (1/1) ... [2022-11-03 02:34:42,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:34:42" (1/1) ... [2022-11-03 02:34:42,441 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:34:42" (1/1) ... [2022-11-03 02:34:42,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:34:42" (1/1) ... [2022-11-03 02:34:42,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:34:42,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:34:42,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:34:42,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:34:42,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:34:42" (1/1) ... [2022-11-03 02:34:42,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:34:42,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:34:42,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:34:42,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:34:42,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:34:42,534 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-11-03 02:34:42,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-11-03 02:34:42,534 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-03 02:34:42,535 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-03 02:34:42,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:34:42,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:34:42,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:34:42,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:34:42,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:34:42,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:34:42,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:34:42,537 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 02:34:42,682 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:34:42,684 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:34:43,020 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:34:43,235 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:34:43,235 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-03 02:34:43,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:34:43 BoogieIcfgContainer [2022-11-03 02:34:43,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:34:43,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:34:43,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:34:43,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:34:43,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:34:41" (1/3) ... [2022-11-03 02:34:43,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487558d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:34:43, skipping insertion in model container [2022-11-03 02:34:43,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:34:42" (2/3) ... [2022-11-03 02:34:43,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487558d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:34:43, skipping insertion in model container [2022-11-03 02:34:43,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:34:43" (3/3) ... [2022-11-03 02:34:43,252 INFO L112 eAbstractionObserver]: Analyzing ICFG 34_double_lock_p2_vs.i [2022-11-03 02:34:43,261 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:34:43,278 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:34:43,279 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:34:43,279 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:34:43,371 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:34:43,427 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:34:43,445 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 79 transitions, 168 flow [2022-11-03 02:34:43,451 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 79 transitions, 168 flow [2022-11-03 02:34:43,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 79 transitions, 168 flow [2022-11-03 02:34:43,534 INFO L130 PetriNetUnfolder]: 7/89 cut-off events. [2022-11-03 02:34:43,534 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-03 02:34:43,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 89 events. 7/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 156 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 68. Up to 4 conditions per place. [2022-11-03 02:34:43,546 INFO L118 LiptonReduction]: Number of co-enabled transitions 1818 [2022-11-03 02:34:46,556 INFO L133 LiptonReduction]: Checked pairs total: 5002 [2022-11-03 02:34:46,556 INFO L135 LiptonReduction]: Total number of compositions: 56 [2022-11-03 02:34:46,565 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 29 transitions, 68 flow [2022-11-03 02:34:46,654 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 433 states, 429 states have (on average 2.9463869463869465) internal successors, (1264), 432 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:34:46,671 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:34:46,677 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;@312350af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:34:46,677 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-03 02:34:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 433 states, 429 states have (on average 2.9463869463869465) internal successors, (1264), 432 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:34:46,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:34:46,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:46,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 02:34:46,687 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:34:46,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:46,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1640363417, now seen corresponding path program 1 times [2022-11-03 02:34:46,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:46,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504758743] [2022-11-03 02:34:46,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:46,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:34:47,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:47,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504758743] [2022-11-03 02:34:47,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504758743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:34:47,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:34:47,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:34:47,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775486605] [2022-11-03 02:34:47,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:34:47,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:34:47,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:47,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:34:47,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:34:47,062 INFO L87 Difference]: Start difference. First operand has 433 states, 429 states have (on average 2.9463869463869465) internal successors, (1264), 432 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:34:47,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:47,189 INFO L93 Difference]: Finished difference Result 287 states and 782 transitions. [2022-11-03 02:34:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:34:47,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-11-03 02:34:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:47,207 INFO L225 Difference]: With dead ends: 287 [2022-11-03 02:34:47,208 INFO L226 Difference]: Without dead ends: 287 [2022-11-03 02:34:47,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:34:47,212 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:47,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:34:47,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-03 02:34:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2022-11-03 02:34:47,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 2.734265734265734) internal successors, (782), 286 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:34:47,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 782 transitions. [2022-11-03 02:34:47,271 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 782 transitions. Word has length 6 [2022-11-03 02:34:47,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:47,272 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 782 transitions. [2022-11-03 02:34:47,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:34:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 782 transitions. [2022-11-03 02:34:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:34:47,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:47,274 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:47,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:34:47,275 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:34:47,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:47,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1436012639, now seen corresponding path program 1 times [2022-11-03 02:34:47,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:47,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720334972] [2022-11-03 02:34:47,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:34:47,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:34:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:34:47,336 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:34:47,336 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:34:47,338 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-11-03 02:34:47,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-11-03 02:34:47,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-11-03 02:34:47,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-11-03 02:34:47,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:34:47,344 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-03 02:34:47,347 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-03 02:34:47,347 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-03 02:34:47,387 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:34:47,390 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:34:47,391 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 118 transitions, 260 flow [2022-11-03 02:34:47,391 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 118 transitions, 260 flow [2022-11-03 02:34:47,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 118 transitions, 260 flow [2022-11-03 02:34:47,427 INFO L130 PetriNetUnfolder]: 9/123 cut-off events. [2022-11-03 02:34:47,427 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-03 02:34:47,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 123 events. 9/123 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 273 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 132. Up to 6 conditions per place. [2022-11-03 02:34:47,432 INFO L118 LiptonReduction]: Number of co-enabled transitions 3932 [2022-11-03 02:34:53,427 INFO L133 LiptonReduction]: Checked pairs total: 11307 [2022-11-03 02:34:53,427 INFO L135 LiptonReduction]: Total number of compositions: 89 [2022-11-03 02:34:53,428 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 45 transitions, 114 flow [2022-11-03 02:34:53,608 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4219 states, 4214 states have (on average 3.938775510204082) internal successors, (16598), 4218 states have internal predecessors, (16598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:34:53,610 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:34:53,611 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;@312350af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:34:53,611 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-03 02:34:53,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 4219 states, 4214 states have (on average 3.938775510204082) internal successors, (16598), 4218 states have internal predecessors, (16598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:34:53,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:34:53,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:53,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 02:34:53,630 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:34:53,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:53,630 INFO L85 PathProgramCache]: Analyzing trace with hash 294957558, now seen corresponding path program 1 times [2022-11-03 02:34:53,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:53,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804868868] [2022-11-03 02:34:53,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:53,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:34:53,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:53,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804868868] [2022-11-03 02:34:53,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804868868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:34:53,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:34:53,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:34:53,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416110744] [2022-11-03 02:34:53,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:34:53,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:34:53,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:53,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:34:53,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:34:53,737 INFO L87 Difference]: Start difference. First operand has 4219 states, 4214 states have (on average 3.938775510204082) internal successors, (16598), 4218 states have internal predecessors, (16598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:34:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:53,846 INFO L93 Difference]: Finished difference Result 3084 states and 11679 transitions. [2022-11-03 02:34:53,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:34:53,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-11-03 02:34:53,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:53,876 INFO L225 Difference]: With dead ends: 3084 [2022-11-03 02:34:53,876 INFO L226 Difference]: Without dead ends: 3084 [2022-11-03 02:34:53,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:34:53,878 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:53,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 14 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:34:53,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2022-11-03 02:34:54,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 3084. [2022-11-03 02:34:54,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3084 states, 3083 states have (on average 3.7881933181965617) internal successors, (11679), 3083 states have internal predecessors, (11679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:34:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 11679 transitions. [2022-11-03 02:34:54,118 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 11679 transitions. Word has length 6 [2022-11-03 02:34:54,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:54,118 INFO L495 AbstractCegarLoop]: Abstraction has 3084 states and 11679 transitions. [2022-11-03 02:34:54,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:34:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 11679 transitions. [2022-11-03 02:34:54,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:34:54,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:54,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:54,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:34:54,122 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:34:54,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:54,122 INFO L85 PathProgramCache]: Analyzing trace with hash -509064738, now seen corresponding path program 1 times [2022-11-03 02:34:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:54,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810698066] [2022-11-03 02:34:54,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:54,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:34:54,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:54,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810698066] [2022-11-03 02:34:54,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810698066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:34:54,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:34:54,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:34:54,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051426542] [2022-11-03 02:34:54,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:34:54,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:34:54,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:54,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:34:54,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:34:54,234 INFO L87 Difference]: Start difference. First operand 3084 states and 11679 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 02:34:54,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:54,446 INFO L93 Difference]: Finished difference Result 3596 states and 13216 transitions. [2022-11-03 02:34:54,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:34:54,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 02:34:54,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:54,475 INFO L225 Difference]: With dead ends: 3596 [2022-11-03 02:34:54,475 INFO L226 Difference]: Without dead ends: 3596 [2022-11-03 02:34:54,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:34:54,477 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:54,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 26 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:34:54,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3596 states. [2022-11-03 02:34:54,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3596 to 3084. [2022-11-03 02:34:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3084 states, 3083 states have (on average 3.7755433019785922) internal successors, (11640), 3083 states have internal predecessors, (11640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:34:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 11640 transitions. [2022-11-03 02:34:54,700 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 11640 transitions. Word has length 12 [2022-11-03 02:34:54,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:54,701 INFO L495 AbstractCegarLoop]: Abstraction has 3084 states and 11640 transitions. [2022-11-03 02:34:54,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 02:34:54,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 11640 transitions. [2022-11-03 02:34:54,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:34:54,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:54,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:54,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:34:54,704 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:34:54,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:54,704 INFO L85 PathProgramCache]: Analyzing trace with hash -509033986, now seen corresponding path program 1 times [2022-11-03 02:34:54,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:54,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338138028] [2022-11-03 02:34:54,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:54,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:34:54,816 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:54,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338138028] [2022-11-03 02:34:54,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338138028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:34:54,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:34:54,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:34:54,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516266137] [2022-11-03 02:34:54,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:34:54,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:34:54,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:54,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:34:54,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:34:54,828 INFO L87 Difference]: Start difference. First operand 3084 states and 11640 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 02:34:55,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:55,026 INFO L93 Difference]: Finished difference Result 3746 states and 13590 transitions. [2022-11-03 02:34:55,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:34:55,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 02:34:55,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:55,053 INFO L225 Difference]: With dead ends: 3746 [2022-11-03 02:34:55,054 INFO L226 Difference]: Without dead ends: 3746 [2022-11-03 02:34:55,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:34:55,057 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:55,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 29 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:34:55,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2022-11-03 02:34:55,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3746. [2022-11-03 02:34:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3746 states, 3745 states have (on average 3.628838451268358) internal successors, (13590), 3745 states have internal predecessors, (13590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:34:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3746 states to 3746 states and 13590 transitions. [2022-11-03 02:34:55,269 INFO L78 Accepts]: Start accepts. Automaton has 3746 states and 13590 transitions. Word has length 12 [2022-11-03 02:34:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:55,269 INFO L495 AbstractCegarLoop]: Abstraction has 3746 states and 13590 transitions. [2022-11-03 02:34:55,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 02:34:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3746 states and 13590 transitions. [2022-11-03 02:34:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:34:55,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:55,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:55,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:34:55,271 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:34:55,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:55,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1398848564, now seen corresponding path program 1 times [2022-11-03 02:34:55,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:55,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774402229] [2022-11-03 02:34:55,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:55,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:34:55,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:55,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774402229] [2022-11-03 02:34:55,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774402229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:34:55,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:34:55,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:34:55,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276784349] [2022-11-03 02:34:55,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:34:55,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:34:55,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:55,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:34:55,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:34:55,401 INFO L87 Difference]: Start difference. First operand 3746 states and 13590 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:34:55,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:55,658 INFO L93 Difference]: Finished difference Result 4822 states and 16822 transitions. [2022-11-03 02:34:55,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:34:55,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:34:55,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:55,698 INFO L225 Difference]: With dead ends: 4822 [2022-11-03 02:34:55,699 INFO L226 Difference]: Without dead ends: 4822 [2022-11-03 02:34:55,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:34:55,700 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 63 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:55,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 29 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:34:55,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4822 states. [2022-11-03 02:34:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4822 to 4306. [2022-11-03 02:34:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4306 states, 4305 states have (on average 3.56794425087108) internal successors, (15360), 4305 states have internal predecessors, (15360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:34:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4306 states to 4306 states and 15360 transitions. [2022-11-03 02:34:56,162 INFO L78 Accepts]: Start accepts. Automaton has 4306 states and 15360 transitions. Word has length 13 [2022-11-03 02:34:56,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:56,162 INFO L495 AbstractCegarLoop]: Abstraction has 4306 states and 15360 transitions. [2022-11-03 02:34:56,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:34:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand 4306 states and 15360 transitions. [2022-11-03 02:34:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:34:56,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:56,194 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:56,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:34:56,195 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:34:56,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:56,195 INFO L85 PathProgramCache]: Analyzing trace with hash -140464402, now seen corresponding path program 1 times [2022-11-03 02:34:56,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:56,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969458541] [2022-11-03 02:34:56,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:56,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:34:56,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:34:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:34:56,245 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:34:56,246 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:34:56,246 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-11-03 02:34:56,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-03 02:34:56,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-03 02:34:56,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-11-03 02:34:56,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-03 02:34:56,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:34:56,248 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-03 02:34:56,248 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-03 02:34:56,248 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-03 02:34:56,296 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:34:56,307 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:34:56,308 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 157 transitions, 356 flow [2022-11-03 02:34:56,308 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 157 transitions, 356 flow [2022-11-03 02:34:56,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 157 transitions, 356 flow [2022-11-03 02:34:56,338 INFO L130 PetriNetUnfolder]: 11/157 cut-off events. [2022-11-03 02:34:56,339 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-03 02:34:56,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 157 events. 11/157 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 373 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 171. Up to 8 conditions per place. [2022-11-03 02:34:56,346 INFO L118 LiptonReduction]: Number of co-enabled transitions 6886 [2022-11-03 02:35:05,398 INFO L133 LiptonReduction]: Checked pairs total: 18635 [2022-11-03 02:35:05,399 INFO L135 LiptonReduction]: Total number of compositions: 123 [2022-11-03 02:35:05,399 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 59 transitions, 160 flow [2022-11-03 02:35:06,643 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 33787 states, 33781 states have (on average 4.932180811698884) internal successors, (166614), 33786 states have internal predecessors, (166614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:06,644 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:35:06,645 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;@312350af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:35:06,645 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-03 02:35:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 33787 states, 33781 states have (on average 4.932180811698884) internal successors, (166614), 33786 states have internal predecessors, (166614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:35:06,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:06,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 02:35:06,706 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:35:06,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:06,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1080109806, now seen corresponding path program 1 times [2022-11-03 02:35:06,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:35:06,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938502875] [2022-11-03 02:35:06,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:06,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:35:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:35:06,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:35:06,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938502875] [2022-11-03 02:35:06,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938502875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:35:06,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:35:06,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:35:06,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645297876] [2022-11-03 02:35:06,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:35:06,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:35:06,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:35:06,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:35:06,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:35:06,844 INFO L87 Difference]: Start difference. First operand has 33787 states, 33781 states have (on average 4.932180811698884) internal successors, (166614), 33786 states have internal predecessors, (166614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:07,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:07,725 INFO L93 Difference]: Finished difference Result 25296 states and 121413 transitions. [2022-11-03 02:35:07,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:35:07,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-11-03 02:35:07,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:08,282 INFO L225 Difference]: With dead ends: 25296 [2022-11-03 02:35:08,282 INFO L226 Difference]: Without dead ends: 25296 [2022-11-03 02:35:08,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:35:08,284 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:08,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 14 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:35:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25296 states. [2022-11-03 02:35:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25296 to 25296. [2022-11-03 02:35:10,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25296 states, 25295 states have (on average 4.799881399486065) internal successors, (121413), 25295 states have internal predecessors, (121413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25296 states to 25296 states and 121413 transitions. [2022-11-03 02:35:10,437 INFO L78 Accepts]: Start accepts. Automaton has 25296 states and 121413 transitions. Word has length 6 [2022-11-03 02:35:10,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:10,438 INFO L495 AbstractCegarLoop]: Abstraction has 25296 states and 121413 transitions. [2022-11-03 02:35:10,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:10,438 INFO L276 IsEmpty]: Start isEmpty. Operand 25296 states and 121413 transitions. [2022-11-03 02:35:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:35:10,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:10,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:10,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:35:10,439 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:35:10,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:10,440 INFO L85 PathProgramCache]: Analyzing trace with hash 831495146, now seen corresponding path program 1 times [2022-11-03 02:35:10,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:35:10,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020906247] [2022-11-03 02:35:10,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:10,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:35:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:35:10,518 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:35:10,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020906247] [2022-11-03 02:35:10,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020906247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:35:10,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:35:10,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:35:10,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159241835] [2022-11-03 02:35:10,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:35:10,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:35:10,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:35:10,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:35:10,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:35:10,521 INFO L87 Difference]: Start difference. First operand 25296 states and 121413 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 02:35:11,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:11,163 INFO L93 Difference]: Finished difference Result 33863 states and 158075 transitions. [2022-11-03 02:35:11,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:35:11,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 02:35:11,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:11,679 INFO L225 Difference]: With dead ends: 33863 [2022-11-03 02:35:11,679 INFO L226 Difference]: Without dead ends: 33863 [2022-11-03 02:35:11,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:35:11,682 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:11,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 25 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:35:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33863 states. [2022-11-03 02:35:13,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33863 to 33863. [2022-11-03 02:35:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33863 states, 33862 states have (on average 4.668212155218239) internal successors, (158075), 33862 states have internal predecessors, (158075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33863 states to 33863 states and 158075 transitions. [2022-11-03 02:35:13,768 INFO L78 Accepts]: Start accepts. Automaton has 33863 states and 158075 transitions. Word has length 12 [2022-11-03 02:35:13,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:13,768 INFO L495 AbstractCegarLoop]: Abstraction has 33863 states and 158075 transitions. [2022-11-03 02:35:13,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 02:35:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand 33863 states and 158075 transitions. [2022-11-03 02:35:13,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:35:13,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:13,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:13,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:35:13,770 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:35:13,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:13,771 INFO L85 PathProgramCache]: Analyzing trace with hash 831226066, now seen corresponding path program 1 times [2022-11-03 02:35:13,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:35:13,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070389430] [2022-11-03 02:35:13,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:13,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:35:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:35:13,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:35:13,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070389430] [2022-11-03 02:35:13,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070389430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:35:13,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:35:13,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:35:13,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128895131] [2022-11-03 02:35:13,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:35:13,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:35:13,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:35:13,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:35:13,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:35:13,841 INFO L87 Difference]: Start difference. First operand 33863 states and 158075 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 02:35:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:14,260 INFO L93 Difference]: Finished difference Result 38107 states and 174904 transitions. [2022-11-03 02:35:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:35:14,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 02:35:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:15,135 INFO L225 Difference]: With dead ends: 38107 [2022-11-03 02:35:15,135 INFO L226 Difference]: Without dead ends: 38107 [2022-11-03 02:35:15,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:35:15,136 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 42 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:15,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 30 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:35:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38107 states. [2022-11-03 02:35:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38107 to 33863. [2022-11-03 02:35:16,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33863 states, 33862 states have (on average 4.661803791861083) internal successors, (157858), 33862 states have internal predecessors, (157858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33863 states to 33863 states and 157858 transitions. [2022-11-03 02:35:17,088 INFO L78 Accepts]: Start accepts. Automaton has 33863 states and 157858 transitions. Word has length 12 [2022-11-03 02:35:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:17,089 INFO L495 AbstractCegarLoop]: Abstraction has 33863 states and 157858 transitions. [2022-11-03 02:35:17,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 02:35:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 33863 states and 157858 transitions. [2022-11-03 02:35:17,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:35:17,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:17,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:17,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:35:17,107 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:35:17,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:17,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1863966, now seen corresponding path program 1 times [2022-11-03 02:35:17,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:35:17,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573130080] [2022-11-03 02:35:17,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:17,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:35:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:35:17,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:35:17,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573130080] [2022-11-03 02:35:17,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573130080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:35:17,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:35:17,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:35:17,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074175340] [2022-11-03 02:35:17,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:35:17,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:35:17,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:35:17,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:35:17,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:35:17,220 INFO L87 Difference]: Start difference. First operand 33863 states and 157858 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:17,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:17,916 INFO L93 Difference]: Finished difference Result 50062 states and 225711 transitions. [2022-11-03 02:35:17,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:35:17,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:35:17,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:18,256 INFO L225 Difference]: With dead ends: 50062 [2022-11-03 02:35:18,256 INFO L226 Difference]: Without dead ends: 50062 [2022-11-03 02:35:18,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:35:18,257 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 76 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:18,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 33 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:35:18,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50062 states. [2022-11-03 02:35:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50062 to 43306. [2022-11-03 02:35:20,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43306 states, 43305 states have (on average 4.60138552130239) internal successors, (199263), 43305 states have internal predecessors, (199263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43306 states to 43306 states and 199263 transitions. [2022-11-03 02:35:20,795 INFO L78 Accepts]: Start accepts. Automaton has 43306 states and 199263 transitions. Word has length 13 [2022-11-03 02:35:20,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:20,795 INFO L495 AbstractCegarLoop]: Abstraction has 43306 states and 199263 transitions. [2022-11-03 02:35:20,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 43306 states and 199263 transitions. [2022-11-03 02:35:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:35:20,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:20,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:20,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:35:20,798 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:35:20,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:20,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1239540457, now seen corresponding path program 1 times [2022-11-03 02:35:20,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:35:20,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406325942] [2022-11-03 02:35:20,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:20,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:35:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:35:20,850 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:35:20,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406325942] [2022-11-03 02:35:20,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406325942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:35:20,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:35:20,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:35:20,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692172558] [2022-11-03 02:35:20,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:35:20,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:35:20,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:35:20,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:35:20,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:35:20,852 INFO L87 Difference]: Start difference. First operand 43306 states and 199263 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:22,018 INFO L93 Difference]: Finished difference Result 71715 states and 323206 transitions. [2022-11-03 02:35:22,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:35:22,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-11-03 02:35:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:22,463 INFO L225 Difference]: With dead ends: 71715 [2022-11-03 02:35:22,463 INFO L226 Difference]: Without dead ends: 71715 [2022-11-03 02:35:22,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:35:22,464 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 50 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:22,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 18 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:35:22,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71715 states. [2022-11-03 02:35:25,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71715 to 61901. [2022-11-03 02:35:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61901 states, 61900 states have (on average 4.568546042003231) internal successors, (282793), 61900 states have internal predecessors, (282793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61901 states to 61901 states and 282793 transitions. [2022-11-03 02:35:25,560 INFO L78 Accepts]: Start accepts. Automaton has 61901 states and 282793 transitions. Word has length 15 [2022-11-03 02:35:25,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:25,561 INFO L495 AbstractCegarLoop]: Abstraction has 61901 states and 282793 transitions. [2022-11-03 02:35:25,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:25,561 INFO L276 IsEmpty]: Start isEmpty. Operand 61901 states and 282793 transitions. [2022-11-03 02:35:25,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:35:25,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:25,568 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:25,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 02:35:25,569 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:35:25,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:25,569 INFO L85 PathProgramCache]: Analyzing trace with hash -58708818, now seen corresponding path program 1 times [2022-11-03 02:35:25,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:35:25,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360508848] [2022-11-03 02:35:25,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:25,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:35:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:25,780 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 02:35:25,780 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:35:25,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360508848] [2022-11-03 02:35:25,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360508848] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:35:25,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055269925] [2022-11-03 02:35:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:25,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:25,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:35:25,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:35:25,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:35:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:25,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 02:35:25,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:26,019 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:35:26,020 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 02:35:26,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-11-03 02:35:26,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:35:26,326 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 02:35:26,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:26,373 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_141 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#mutexb~0.base|) |c_~#mutexb~0.offset|) 0))) is different from false [2022-11-03 02:35:26,405 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:26,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-11-03 02:35:26,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 treesize of output 25 [2022-11-03 02:35:26,415 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 6 treesize of output 4 [2022-11-03 02:35:26,436 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 02:35:26,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055269925] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:26,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [369024477] [2022-11-03 02:35:26,445 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 02:35:26,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:35:26,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-11-03 02:35:26,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689265127] [2022-11-03 02:35:26,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:35:26,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:35:26,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:35:26,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:35:26,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=58, Unknown=1, NotChecked=16, Total=110 [2022-11-03 02:35:26,451 INFO L87 Difference]: Start difference. First operand 61901 states and 282793 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:28,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:28,182 INFO L93 Difference]: Finished difference Result 92517 states and 402283 transitions. [2022-11-03 02:35:28,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:35:28,182 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 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 18 [2022-11-03 02:35:28,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:28,706 INFO L225 Difference]: With dead ends: 92517 [2022-11-03 02:35:28,706 INFO L226 Difference]: Without dead ends: 92517 [2022-11-03 02:35:28,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=58, Unknown=1, NotChecked=16, Total=110 [2022-11-03 02:35:28,707 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 167 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:28,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 29 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 86 Invalid, 0 Unknown, 67 Unchecked, 0.1s Time] [2022-11-03 02:35:28,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92517 states. [2022-11-03 02:35:31,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92517 to 71419. [2022-11-03 02:35:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71419 states, 71418 states have (on average 4.396132627628889) internal successors, (313963), 71418 states have internal predecessors, (313963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71419 states to 71419 states and 313963 transitions. [2022-11-03 02:35:32,501 INFO L78 Accepts]: Start accepts. Automaton has 71419 states and 313963 transitions. Word has length 18 [2022-11-03 02:35:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:32,501 INFO L495 AbstractCegarLoop]: Abstraction has 71419 states and 313963 transitions. [2022-11-03 02:35:32,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 71419 states and 313963 transitions. [2022-11-03 02:35:32,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:35:32,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:32,510 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:32,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-03 02:35:32,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e86c820-727a-4f30-b2b9-ab8ff4638a0b/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 02:35:32,735 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:35:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:32,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2081473872, now seen corresponding path program 1 times [2022-11-03 02:35:32,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:35:32,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554980691] [2022-11-03 02:35:32,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:32,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:35:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:35:32,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:35:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:35:32,771 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:35:32,771 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:35:32,772 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-11-03 02:35:32,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-03 02:35:32,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-03 02:35:32,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-11-03 02:35:32,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-11-03 02:35:32,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-03 02:35:32,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 02:35:32,774 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:32,774 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-03 02:35:32,774 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-03 02:35:32,839 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:35:32,844 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:35:32,844 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 196 transitions, 456 flow [2022-11-03 02:35:32,845 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 196 transitions, 456 flow [2022-11-03 02:35:32,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 196 transitions, 456 flow [2022-11-03 02:35:32,923 INFO L130 PetriNetUnfolder]: 13/191 cut-off events. [2022-11-03 02:35:32,923 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-03 02:35:32,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 191 events. 13/191 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 491 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 211. Up to 10 conditions per place. [2022-11-03 02:35:32,937 INFO L118 LiptonReduction]: Number of co-enabled transitions 10680 [2022-11-03 02:35:46,477 INFO L133 LiptonReduction]: Checked pairs total: 33419 [2022-11-03 02:35:46,477 INFO L135 LiptonReduction]: Total number of compositions: 161 [2022-11-03 02:35:46,478 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 73 transitions, 210 flow [2022-11-03 02:35:57,685 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 270331 states, 270324 states have (on average 5.930979121350675) internal successors, (1603286), 270330 states have internal predecessors, (1603286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:57,686 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:35:57,687 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;@312350af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:35:57,687 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-03 02:35:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 270331 states, 270324 states have (on average 5.930979121350675) internal successors, (1603286), 270330 states have internal predecessors, (1603286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:35:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:35:58,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:58,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 02:35:58,065 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:35:58,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:58,067 INFO L85 PathProgramCache]: Analyzing trace with hash -97878146, now seen corresponding path program 1 times [2022-11-03 02:35:58,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:35:58,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11738610] [2022-11-03 02:35:58,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:58,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:35:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:35:58,094 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:35:58,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11738610] [2022-11-03 02:35:58,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11738610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:35:58,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:35:58,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:35:58,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603125467] [2022-11-03 02:35:58,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:35:58,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:35:58,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:35:58,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:35:58,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:35:58,558 INFO L87 Difference]: Start difference. First operand has 270331 states, 270324 states have (on average 5.930979121350675) internal successors, (1603286), 270330 states have internal predecessors, (1603286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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)