./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b 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_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13ffae79fd42fd88852ffaba2bbbf2601df90fdda2b5dc6bd9b6228e2cf540c7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 07:18:35,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:18:35,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:18:35,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:18:35,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:18:35,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:18:35,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:18:35,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:18:35,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:18:35,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:18:35,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:18:35,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:18:35,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:18:35,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:18:35,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:18:35,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:18:35,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:18:35,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:18:35,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:18:35,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:18:35,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:18:35,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:18:35,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:18:35,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:18:35,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:18:35,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:18:35,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:18:35,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:18:35,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:18:35,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:18:35,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:18:35,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:18:35,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:18:35,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:18:35,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:18:35,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:18:35,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:18:35,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:18:35,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:18:35,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:18:35,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:18:35,438 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 07:18:35,482 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:18:35,482 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:18:35,483 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:18:35,483 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:18:35,483 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:18:35,484 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:18:35,484 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:18:35,484 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:18:35,484 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:18:35,484 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:18:35,485 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:18:35,485 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:18:35,485 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:18:35,485 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:18:35,485 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:18:35,486 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:18:35,486 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:18:35,486 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:18:35,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:18:35,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:18:35,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:18:35,489 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:18:35,489 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:18:35,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:18:35,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:18:35,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:18:35,492 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:18:35,492 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:18:35,493 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:18:35,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:18:35,493 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:18:35,493 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:18:35,493 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:18:35,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:18:35,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:18:35,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:18:35,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:18:35,495 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:18:35,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:18:35,496 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:18:35,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:18:35,496 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:18:35,496 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_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/bin/utaipan-I9t0OCRTmS/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_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/bin/utaipan-I9t0OCRTmS 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13ffae79fd42fd88852ffaba2bbbf2601df90fdda2b5dc6bd9b6228e2cf540c7 [2022-11-19 07:18:35,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:18:35,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:18:35,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:18:35,841 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:18:35,842 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:18:35,843 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2022-11-19 07:18:35,908 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/bin/utaipan-I9t0OCRTmS/data/8f66fc5a8/c3a9c18d749b45bb996117098facc6f0/FLAG1961111f9 [2022-11-19 07:18:36,442 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:18:36,445 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2022-11-19 07:18:36,466 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/bin/utaipan-I9t0OCRTmS/data/8f66fc5a8/c3a9c18d749b45bb996117098facc6f0/FLAG1961111f9 [2022-11-19 07:18:36,741 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/bin/utaipan-I9t0OCRTmS/data/8f66fc5a8/c3a9c18d749b45bb996117098facc6f0 [2022-11-19 07:18:36,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:18:36,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:18:36,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:18:36,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:18:36,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:18:36,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:18:36" (1/1) ... [2022-11-19 07:18:36,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@316f8c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:36, skipping insertion in model container [2022-11-19 07:18:36,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:18:36" (1/1) ... [2022-11-19 07:18:36,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:18:36,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:18:37,045 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-19 07:18:37,193 WARN L234 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_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i[30959,30972] [2022-11-19 07:18:37,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:18:37,221 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:18:37,250 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-19 07:18:37,284 WARN L234 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_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i[30959,30972] [2022-11-19 07:18:37,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:18:37,338 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:18:37,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:37 WrapperNode [2022-11-19 07:18:37,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:18:37,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:18:37,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:18:37,341 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:18:37,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:37" (1/1) ... [2022-11-19 07:18:37,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:37" (1/1) ... [2022-11-19 07:18:37,417 INFO L138 Inliner]: procedures = 176, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 75 [2022-11-19 07:18:37,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:18:37,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:18:37,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:18:37,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:18:37,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:37" (1/1) ... [2022-11-19 07:18:37,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:37" (1/1) ... [2022-11-19 07:18:37,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:37" (1/1) ... [2022-11-19 07:18:37,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:37" (1/1) ... [2022-11-19 07:18:37,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:37" (1/1) ... [2022-11-19 07:18:37,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:37" (1/1) ... [2022-11-19 07:18:37,461 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:37" (1/1) ... [2022-11-19 07:18:37,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:37" (1/1) ... [2022-11-19 07:18:37,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:18:37,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:18:37,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:18:37,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:18:37,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:37" (1/1) ... [2022-11-19 07:18:37,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:18:37,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:18:37,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:18:37,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c77a2bd5-caa3-4c8d-bc17-770e9c905d9d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:18:37,564 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-19 07:18:37,564 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-19 07:18:37,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:18:37,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:18:37,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:18:37,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:18:37,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:18:37,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:18:37,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:18:37,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:18:37,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:18:37,568 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:18:37,725 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:18:37,727 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:18:38,025 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:18:38,080 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:18:38,085 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-19 07:18:38,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:18:38 BoogieIcfgContainer [2022-11-19 07:18:38,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:18:38,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:18:38,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:18:38,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:18:38,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:18:36" (1/3) ... [2022-11-19 07:18:38,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d832b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:18:38, skipping insertion in model container [2022-11-19 07:18:38,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:18:37" (2/3) ... [2022-11-19 07:18:38,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d832b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:18:38, skipping insertion in model container [2022-11-19 07:18:38,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:18:38" (3/3) ... [2022-11-19 07:18:38,101 INFO L112 eAbstractionObserver]: Analyzing ICFG 39_rand_lock_p0_vs.i [2022-11-19 07:18:38,125 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:18:38,125 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-19 07:18:38,126 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:18:38,266 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:18:38,315 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:18:38,335 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 75 transitions, 155 flow [2022-11-19 07:18:38,344 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 75 transitions, 155 flow [2022-11-19 07:18:38,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 75 transitions, 155 flow [2022-11-19 07:18:38,430 INFO L130 PetriNetUnfolder]: 4/91 cut-off events. [2022-11-19 07:18:38,431 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:18:38,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 91 events. 4/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 108 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2022-11-19 07:18:38,441 INFO L119 LiptonReduction]: Number of co-enabled transitions 1482 [2022-11-19 07:18:41,152 INFO L134 LiptonReduction]: Checked pairs total: 1295 [2022-11-19 07:18:41,153 INFO L136 LiptonReduction]: Total number of compositions: 77 [2022-11-19 07:18:41,161 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 13 transitions, 31 flow [2022-11-19 07:18:41,174 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 36 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:41,191 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:18:41,196 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@6bc9e352, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:18:41,196 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-19 07:18:41,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:41,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-19 07:18:41,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:41,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-19 07:18:41,204 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2022-11-19 07:18:41,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:41,209 INFO L85 PathProgramCache]: Analyzing trace with hash 12038, now seen corresponding path program 1 times [2022-11-19 07:18:41,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:41,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546122219] [2022-11-19 07:18:41,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:41,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:41,476 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-19 07:18:41,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:41,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546122219] [2022-11-19 07:18:41,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546122219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:41,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:41,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:18:41,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878565071] [2022-11-19 07:18:41,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:41,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:18:41,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:41,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:18:41,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:41,510 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:41,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:41,546 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2022-11-19 07:18:41,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:18:41,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-19 07:18:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:41,559 INFO L225 Difference]: With dead ends: 24 [2022-11-19 07:18:41,559 INFO L226 Difference]: Without dead ends: 24 [2022-11-19 07:18:41,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:41,565 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:41,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-19 07:18:41,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-19 07:18:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 23 states have internal predecessors, (40), 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-19 07:18:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 40 transitions. [2022-11-19 07:18:41,602 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 40 transitions. Word has length 2 [2022-11-19 07:18:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:41,602 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 40 transitions. [2022-11-19 07:18:41,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 40 transitions. [2022-11-19 07:18:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-19 07:18:41,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:41,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-19 07:18:41,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:18:41,608 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2022-11-19 07:18:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash 12037, now seen corresponding path program 1 times [2022-11-19 07:18:41,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:41,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767357772] [2022-11-19 07:18:41,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:41,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:41,729 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-19 07:18:41,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:41,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767357772] [2022-11-19 07:18:41,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767357772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:41,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:41,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:18:41,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307263860] [2022-11-19 07:18:41,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:41,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:18:41,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:41,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:18:41,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:41,738 INFO L87 Difference]: Start difference. First operand 24 states and 40 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:41,753 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2022-11-19 07:18:41,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:18:41,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-19 07:18:41,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:41,756 INFO L225 Difference]: With dead ends: 19 [2022-11-19 07:18:41,756 INFO L226 Difference]: Without dead ends: 19 [2022-11-19 07:18:41,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:41,758 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:41,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:41,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-19 07:18:41,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-19 07:18:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2022-11-19 07:18:41,769 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 2 [2022-11-19 07:18:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:41,770 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 31 transitions. [2022-11-19 07:18:41,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2022-11-19 07:18:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-19 07:18:41,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:41,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-19 07:18:41,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:18:41,772 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2022-11-19 07:18:41,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash 11575371, now seen corresponding path program 1 times [2022-11-19 07:18:41,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:41,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112134552] [2022-11-19 07:18:41,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:41,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:41,854 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-19 07:18:41,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:41,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112134552] [2022-11-19 07:18:41,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112134552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:41,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:41,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:18:41,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372187200] [2022-11-19 07:18:41,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:41,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:18:41,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:41,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:18:41,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:41,857 INFO L87 Difference]: Start difference. First operand 19 states and 31 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:41,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:41,884 INFO L93 Difference]: Finished difference Result 15 states and 24 transitions. [2022-11-19 07:18:41,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:18:41,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-19 07:18:41,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:41,886 INFO L225 Difference]: With dead ends: 15 [2022-11-19 07:18:41,886 INFO L226 Difference]: Without dead ends: 15 [2022-11-19 07:18:41,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:41,888 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:41,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:41,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-19 07:18:41,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-19 07:18:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2022-11-19 07:18:41,896 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 4 [2022-11-19 07:18:41,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:41,897 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 24 transitions. [2022-11-19 07:18:41,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 24 transitions. [2022-11-19 07:18:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 07:18:41,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:41,898 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2022-11-19 07:18:41,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:18:41,899 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2022-11-19 07:18:41,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:41,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1761013083, now seen corresponding path program 1 times [2022-11-19 07:18:41,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:41,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000445784] [2022-11-19 07:18:41,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:41,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:18:41,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:18:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:18:41,962 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:18:41,962 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:18:41,964 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-11-19 07:18:41,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2022-11-19 07:18:41,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2022-11-19 07:18:41,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2022-11-19 07:18:41,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2022-11-19 07:18:41,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2022-11-19 07:18:41,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:18:41,975 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-19 07:18:41,977 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-19 07:18:41,977 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-19 07:18:42,015 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:18:42,020 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:18:42,021 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 115 transitions, 242 flow [2022-11-19 07:18:42,021 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 115 transitions, 242 flow [2022-11-19 07:18:42,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 115 transitions, 242 flow [2022-11-19 07:18:42,080 INFO L130 PetriNetUnfolder]: 7/149 cut-off events. [2022-11-19 07:18:42,081 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-19 07:18:42,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 149 events. 7/149 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 306 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 96. Up to 6 conditions per place. [2022-11-19 07:18:42,088 INFO L119 LiptonReduction]: Number of co-enabled transitions 6084 [2022-11-19 07:18:45,037 INFO L134 LiptonReduction]: Checked pairs total: 7144 [2022-11-19 07:18:45,037 INFO L136 LiptonReduction]: Total number of compositions: 115 [2022-11-19 07:18:45,038 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 25 transitions, 62 flow [2022-11-19 07:18:45,074 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 358 states, 329 states have (on average 3.282674772036474) internal successors, (1080), 357 states have internal predecessors, (1080), 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-19 07:18:45,075 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:18:45,076 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@6bc9e352, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:18:45,076 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-19 07:18:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 358 states, 329 states have (on average 3.282674772036474) internal successors, (1080), 357 states have internal predecessors, (1080), 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-19 07:18:45,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-19 07:18:45,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:45,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-19 07:18:45,080 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-19 07:18:45,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:45,080 INFO L85 PathProgramCache]: Analyzing trace with hash 20607, now seen corresponding path program 1 times [2022-11-19 07:18:45,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:45,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892752651] [2022-11-19 07:18:45,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:45,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:45,109 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-19 07:18:45,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:45,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892752651] [2022-11-19 07:18:45,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892752651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:45,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:45,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:18:45,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89052368] [2022-11-19 07:18:45,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:45,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:18:45,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:45,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:18:45,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:18:45,113 INFO L87 Difference]: Start difference. First operand has 358 states, 329 states have (on average 3.282674772036474) internal successors, (1080), 357 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:45,166 INFO L93 Difference]: Finished difference Result 293 states and 797 transitions. [2022-11-19 07:18:45,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:18:45,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-19 07:18:45,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:45,178 INFO L225 Difference]: With dead ends: 293 [2022-11-19 07:18:45,179 INFO L226 Difference]: Without dead ends: 293 [2022-11-19 07:18:45,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:18:45,181 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:45,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:45,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-19 07:18:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2022-11-19 07:18:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 275 states have (on average 2.898181818181818) internal successors, (797), 292 states have internal predecessors, (797), 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-19 07:18:45,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 797 transitions. [2022-11-19 07:18:45,226 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 797 transitions. Word has length 2 [2022-11-19 07:18:45,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:45,226 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 797 transitions. [2022-11-19 07:18:45,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:45,227 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 797 transitions. [2022-11-19 07:18:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-19 07:18:45,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:45,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-19 07:18:45,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:18:45,228 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-19 07:18:45,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:45,229 INFO L85 PathProgramCache]: Analyzing trace with hash 20625, now seen corresponding path program 1 times [2022-11-19 07:18:45,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:45,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987702642] [2022-11-19 07:18:45,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:45,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:45,256 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-19 07:18:45,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:45,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987702642] [2022-11-19 07:18:45,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987702642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:45,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:45,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:18:45,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614696304] [2022-11-19 07:18:45,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:45,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:18:45,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:45,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:18:45,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:45,259 INFO L87 Difference]: Start difference. First operand 293 states and 797 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:45,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:45,286 INFO L93 Difference]: Finished difference Result 250 states and 676 transitions. [2022-11-19 07:18:45,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:18:45,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-19 07:18:45,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:45,289 INFO L225 Difference]: With dead ends: 250 [2022-11-19 07:18:45,289 INFO L226 Difference]: Without dead ends: 250 [2022-11-19 07:18:45,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:45,290 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:45,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:45,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-19 07:18:45,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-11-19 07:18:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 2.8284518828451883) internal successors, (676), 249 states have internal predecessors, (676), 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-19 07:18:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 676 transitions. [2022-11-19 07:18:45,306 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 676 transitions. Word has length 2 [2022-11-19 07:18:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:45,307 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 676 transitions. [2022-11-19 07:18:45,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 676 transitions. [2022-11-19 07:18:45,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-19 07:18:45,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:45,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-19 07:18:45,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:18:45,308 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-19 07:18:45,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:45,309 INFO L85 PathProgramCache]: Analyzing trace with hash 20626, now seen corresponding path program 1 times [2022-11-19 07:18:45,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:45,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541521543] [2022-11-19 07:18:45,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:45,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:45,350 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-19 07:18:45,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:45,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541521543] [2022-11-19 07:18:45,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541521543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:45,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:45,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:18:45,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895143686] [2022-11-19 07:18:45,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:45,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:18:45,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:45,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:18:45,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:45,353 INFO L87 Difference]: Start difference. First operand 250 states and 676 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:45,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:45,384 INFO L93 Difference]: Finished difference Result 207 states and 555 transitions. [2022-11-19 07:18:45,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:18:45,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-19 07:18:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:45,387 INFO L225 Difference]: With dead ends: 207 [2022-11-19 07:18:45,387 INFO L226 Difference]: Without dead ends: 207 [2022-11-19 07:18:45,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:45,388 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:45,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 3 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-19 07:18:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-11-19 07:18:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 203 states have (on average 2.7339901477832513) internal successors, (555), 206 states have internal predecessors, (555), 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-19 07:18:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 555 transitions. [2022-11-19 07:18:45,400 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 555 transitions. Word has length 2 [2022-11-19 07:18:45,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:45,400 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 555 transitions. [2022-11-19 07:18:45,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:45,401 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 555 transitions. [2022-11-19 07:18:45,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-19 07:18:45,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:45,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-19 07:18:45,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:18:45,402 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-19 07:18:45,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:45,403 INFO L85 PathProgramCache]: Analyzing trace with hash 19835864, now seen corresponding path program 1 times [2022-11-19 07:18:45,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:45,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530459479] [2022-11-19 07:18:45,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:45,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:45,427 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-19 07:18:45,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:45,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530459479] [2022-11-19 07:18:45,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530459479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:45,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:45,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:18:45,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091334548] [2022-11-19 07:18:45,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:45,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:18:45,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:45,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:18:45,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:45,430 INFO L87 Difference]: Start difference. First operand 207 states and 555 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:45,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:45,466 INFO L93 Difference]: Finished difference Result 168 states and 439 transitions. [2022-11-19 07:18:45,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:18:45,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-19 07:18:45,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:45,468 INFO L225 Difference]: With dead ends: 168 [2022-11-19 07:18:45,468 INFO L226 Difference]: Without dead ends: 168 [2022-11-19 07:18:45,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:45,469 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:45,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 6 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-19 07:18:45,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-11-19 07:18:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 165 states have (on average 2.6606060606060606) internal successors, (439), 167 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 439 transitions. [2022-11-19 07:18:45,477 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 439 transitions. Word has length 4 [2022-11-19 07:18:45,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:45,478 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 439 transitions. [2022-11-19 07:18:45,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 439 transitions. [2022-11-19 07:18:45,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:18:45,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:45,479 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-11-19 07:18:45,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:18:45,480 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-19 07:18:45,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:45,480 INFO L85 PathProgramCache]: Analyzing trace with hash 726392231, now seen corresponding path program 1 times [2022-11-19 07:18:45,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:45,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509817779] [2022-11-19 07:18:45,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:45,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:18:45,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:18:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:18:45,506 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:18:45,509 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:18:45,510 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2022-11-19 07:18:45,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2022-11-19 07:18:45,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2022-11-19 07:18:45,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2022-11-19 07:18:45,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2022-11-19 07:18:45,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2022-11-19 07:18:45,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2022-11-19 07:18:45,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:18:45,512 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-19 07:18:45,513 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-19 07:18:45,513 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-19 07:18:45,545 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:18:45,548 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:18:45,548 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 155 transitions, 331 flow [2022-11-19 07:18:45,549 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 155 transitions, 331 flow [2022-11-19 07:18:45,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 155 transitions, 331 flow [2022-11-19 07:18:45,588 INFO L130 PetriNetUnfolder]: 10/207 cut-off events. [2022-11-19 07:18:45,588 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-19 07:18:45,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 207 events. 10/207 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 562 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 153. Up to 8 conditions per place. [2022-11-19 07:18:45,600 INFO L119 LiptonReduction]: Number of co-enabled transitions 13806 [2022-11-19 07:18:49,304 INFO L134 LiptonReduction]: Checked pairs total: 16337 [2022-11-19 07:18:49,305 INFO L136 LiptonReduction]: Total number of compositions: 154 [2022-11-19 07:18:49,306 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 33 transitions, 87 flow [2022-11-19 07:18:49,403 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2202 states, 2138 states have (on average 4.291861552853134) internal successors, (9176), 2201 states have internal predecessors, (9176), 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-19 07:18:49,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:18:49,407 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@6bc9e352, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:18:49,407 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-19 07:18:49,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 2202 states, 2138 states have (on average 4.291861552853134) internal successors, (9176), 2201 states have internal predecessors, (9176), 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-19 07:18:49,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-19 07:18:49,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:49,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-19 07:18:49,418 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-19 07:18:49,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:49,419 INFO L85 PathProgramCache]: Analyzing trace with hash 31667, now seen corresponding path program 1 times [2022-11-19 07:18:49,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:49,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619557327] [2022-11-19 07:18:49,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:49,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:49,452 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-19 07:18:49,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:49,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619557327] [2022-11-19 07:18:49,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619557327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:49,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:49,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:18:49,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192992845] [2022-11-19 07:18:49,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:49,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:18:49,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:49,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:18:49,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:18:49,465 INFO L87 Difference]: Start difference. First operand has 2202 states, 2138 states have (on average 4.291861552853134) internal successors, (9176), 2201 states have internal predecessors, (9176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:49,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:49,526 INFO L93 Difference]: Finished difference Result 1769 states and 6557 transitions. [2022-11-19 07:18:49,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:18:49,526 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-19 07:18:49,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:49,544 INFO L225 Difference]: With dead ends: 1769 [2022-11-19 07:18:49,544 INFO L226 Difference]: Without dead ends: 1769 [2022-11-19 07:18:49,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:18:49,545 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:49,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2022-11-19 07:18:49,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1769. [2022-11-19 07:18:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1731 states have (on average 3.787983824378972) internal successors, (6557), 1768 states have internal predecessors, (6557), 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-19 07:18:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 6557 transitions. [2022-11-19 07:18:49,623 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 6557 transitions. Word has length 2 [2022-11-19 07:18:49,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:49,623 INFO L495 AbstractCegarLoop]: Abstraction has 1769 states and 6557 transitions. [2022-11-19 07:18:49,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 6557 transitions. [2022-11-19 07:18:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-19 07:18:49,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:49,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-19 07:18:49,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:18:49,624 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-19 07:18:49,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:49,625 INFO L85 PathProgramCache]: Analyzing trace with hash 31687, now seen corresponding path program 1 times [2022-11-19 07:18:49,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:49,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227758884] [2022-11-19 07:18:49,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:49,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:49,674 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-19 07:18:49,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:49,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227758884] [2022-11-19 07:18:49,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227758884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:49,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:49,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:18:49,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078896128] [2022-11-19 07:18:49,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:49,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:18:49,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:49,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:18:49,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:49,683 INFO L87 Difference]: Start difference. First operand 1769 states and 6557 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:49,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:49,740 INFO L93 Difference]: Finished difference Result 1510 states and 5572 transitions. [2022-11-19 07:18:49,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:18:49,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-19 07:18:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:49,753 INFO L225 Difference]: With dead ends: 1510 [2022-11-19 07:18:49,753 INFO L226 Difference]: Without dead ends: 1510 [2022-11-19 07:18:49,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:49,755 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:49,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2022-11-19 07:18:49,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1510. [2022-11-19 07:18:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1487 states have (on average 3.7471418964357768) internal successors, (5572), 1509 states have internal predecessors, (5572), 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-19 07:18:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 5572 transitions. [2022-11-19 07:18:49,871 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 5572 transitions. Word has length 2 [2022-11-19 07:18:49,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:49,871 INFO L495 AbstractCegarLoop]: Abstraction has 1510 states and 5572 transitions. [2022-11-19 07:18:49,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:49,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 5572 transitions. [2022-11-19 07:18:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-19 07:18:49,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:49,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-19 07:18:49,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:18:49,874 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-19 07:18:49,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:49,875 INFO L85 PathProgramCache]: Analyzing trace with hash 31688, now seen corresponding path program 1 times [2022-11-19 07:18:49,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:49,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596291357] [2022-11-19 07:18:49,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:49,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:49,952 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-19 07:18:49,952 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:49,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596291357] [2022-11-19 07:18:49,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596291357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:49,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:49,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:18:49,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576194029] [2022-11-19 07:18:49,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:49,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:18:49,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:49,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:18:49,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:49,955 INFO L87 Difference]: Start difference. First operand 1510 states and 5572 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:50,015 INFO L93 Difference]: Finished difference Result 1251 states and 4587 transitions. [2022-11-19 07:18:50,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:18:50,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-19 07:18:50,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:50,026 INFO L225 Difference]: With dead ends: 1251 [2022-11-19 07:18:50,026 INFO L226 Difference]: Without dead ends: 1251 [2022-11-19 07:18:50,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:50,028 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:50,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2022-11-19 07:18:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2022-11-19 07:18:50,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1243 states have (on average 3.690265486725664) internal successors, (4587), 1250 states have internal predecessors, (4587), 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-19 07:18:50,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 4587 transitions. [2022-11-19 07:18:50,115 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 4587 transitions. Word has length 2 [2022-11-19 07:18:50,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:50,115 INFO L495 AbstractCegarLoop]: Abstraction has 1251 states and 4587 transitions. [2022-11-19 07:18:50,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:50,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 4587 transitions. [2022-11-19 07:18:50,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-19 07:18:50,117 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:50,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-19 07:18:50,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:18:50,117 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-19 07:18:50,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:50,118 INFO L85 PathProgramCache]: Analyzing trace with hash 30476370, now seen corresponding path program 1 times [2022-11-19 07:18:50,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:50,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306960535] [2022-11-19 07:18:50,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:50,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:50,148 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-19 07:18:50,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:50,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306960535] [2022-11-19 07:18:50,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306960535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:50,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:50,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:18:50,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155033367] [2022-11-19 07:18:50,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:50,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:18:50,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:50,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:18:50,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:50,151 INFO L87 Difference]: Start difference. First operand 1251 states and 4587 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:50,224 INFO L93 Difference]: Finished difference Result 1034 states and 3679 transitions. [2022-11-19 07:18:50,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:18:50,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-19 07:18:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:50,232 INFO L225 Difference]: With dead ends: 1034 [2022-11-19 07:18:50,232 INFO L226 Difference]: Without dead ends: 1034 [2022-11-19 07:18:50,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:50,233 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:50,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-11-19 07:18:50,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2022-11-19 07:18:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1027 states have (on average 3.5822784810126582) internal successors, (3679), 1033 states have internal predecessors, (3679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:50,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 3679 transitions. [2022-11-19 07:18:50,274 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 3679 transitions. Word has length 4 [2022-11-19 07:18:50,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:50,274 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 3679 transitions. [2022-11-19 07:18:50,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:50,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 3679 transitions. [2022-11-19 07:18:50,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:18:50,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:50,276 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:18:50,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 07:18:50,276 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-19 07:18:50,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:50,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1766256815, now seen corresponding path program 1 times [2022-11-19 07:18:50,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:50,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797056277] [2022-11-19 07:18:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:50,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:18:50,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:50,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797056277] [2022-11-19 07:18:50,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797056277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:50,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:50,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:18:50,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064455714] [2022-11-19 07:18:50,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:50,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:18:50,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:50,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:18:50,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:50,350 INFO L87 Difference]: Start difference. First operand 1034 states and 3679 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:50,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:50,392 INFO L93 Difference]: Finished difference Result 748 states and 2718 transitions. [2022-11-19 07:18:50,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:18:50,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-19 07:18:50,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:50,398 INFO L225 Difference]: With dead ends: 748 [2022-11-19 07:18:50,398 INFO L226 Difference]: Without dead ends: 748 [2022-11-19 07:18:50,399 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-19 07:18:50,400 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:50,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:50,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-11-19 07:18:50,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2022-11-19 07:18:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.63855421686747) internal successors, (2718), 747 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:50,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2718 transitions. [2022-11-19 07:18:50,429 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2718 transitions. Word has length 11 [2022-11-19 07:18:50,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:50,430 INFO L495 AbstractCegarLoop]: Abstraction has 748 states and 2718 transitions. [2022-11-19 07:18:50,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:50,430 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2718 transitions. [2022-11-19 07:18:50,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:18:50,438 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:50,438 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-11-19 07:18:50,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 07:18:50,439 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-19 07:18:50,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:50,439 INFO L85 PathProgramCache]: Analyzing trace with hash -223824073, now seen corresponding path program 1 times [2022-11-19 07:18:50,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:50,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502012994] [2022-11-19 07:18:50,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:50,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:18:50,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:18:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:18:50,476 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:18:50,476 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:18:50,477 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2022-11-19 07:18:50,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2022-11-19 07:18:50,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2022-11-19 07:18:50,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2022-11-19 07:18:50,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 8 remaining) [2022-11-19 07:18:50,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2022-11-19 07:18:50,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2022-11-19 07:18:50,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2022-11-19 07:18:50,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 07:18:50,516 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-19 07:18:50,516 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-19 07:18:50,516 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-19 07:18:50,553 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:18:50,556 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:18:50,556 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 195 transitions, 422 flow [2022-11-19 07:18:50,557 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 195 transitions, 422 flow [2022-11-19 07:18:50,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 195 transitions, 422 flow [2022-11-19 07:18:50,625 INFO L130 PetriNetUnfolder]: 13/265 cut-off events. [2022-11-19 07:18:50,625 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-19 07:18:50,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 265 events. 13/265 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 829 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 215. Up to 10 conditions per place. [2022-11-19 07:18:50,644 INFO L119 LiptonReduction]: Number of co-enabled transitions 24648 [2022-11-19 07:18:55,339 INFO L134 LiptonReduction]: Checked pairs total: 29340 [2022-11-19 07:18:55,340 INFO L136 LiptonReduction]: Total number of compositions: 196 [2022-11-19 07:18:55,341 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 41 transitions, 114 flow [2022-11-19 07:18:56,102 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 13394 states, 13259 states have (on average 5.3871332679689266) internal successors, (71428), 13393 states have internal predecessors, (71428), 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-19 07:18:56,103 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:18:56,104 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@6bc9e352, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:18:56,105 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-11-19 07:18:56,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 13394 states, 13259 states have (on average 5.3871332679689266) internal successors, (71428), 13393 states have internal predecessors, (71428), 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-19 07:18:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-19 07:18:56,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:56,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-19 07:18:56,132 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-19 07:18:56,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash 45504, now seen corresponding path program 1 times [2022-11-19 07:18:56,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:56,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193540742] [2022-11-19 07:18:56,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:56,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:56,159 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-19 07:18:56,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:56,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193540742] [2022-11-19 07:18:56,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193540742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:56,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:56,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:18:56,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221956201] [2022-11-19 07:18:56,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:56,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:18:56,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:56,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:18:56,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:56,190 INFO L87 Difference]: Start difference. First operand has 13394 states, 13259 states have (on average 5.3871332679689266) internal successors, (71428), 13393 states have internal predecessors, (71428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:56,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:56,413 INFO L93 Difference]: Finished difference Result 9070 states and 42508 transitions. [2022-11-19 07:18:56,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:18:56,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-19 07:18:56,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:56,634 INFO L225 Difference]: With dead ends: 9070 [2022-11-19 07:18:56,635 INFO L226 Difference]: Without dead ends: 9070 [2022-11-19 07:18:56,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:56,636 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:56,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:56,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9070 states. [2022-11-19 07:18:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9070 to 9070. [2022-11-19 07:18:57,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9070 states, 9023 states have (on average 4.71107170564114) internal successors, (42508), 9069 states have internal predecessors, (42508), 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-19 07:18:57,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9070 states to 9070 states and 42508 transitions. [2022-11-19 07:18:57,290 INFO L78 Accepts]: Start accepts. Automaton has 9070 states and 42508 transitions. Word has length 2 [2022-11-19 07:18:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:57,290 INFO L495 AbstractCegarLoop]: Abstraction has 9070 states and 42508 transitions. [2022-11-19 07:18:57,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:57,290 INFO L276 IsEmpty]: Start isEmpty. Operand 9070 states and 42508 transitions. [2022-11-19 07:18:57,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-19 07:18:57,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:57,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-19 07:18:57,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 07:18:57,293 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-19 07:18:57,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:57,293 INFO L85 PathProgramCache]: Analyzing trace with hash 45505, now seen corresponding path program 1 times [2022-11-19 07:18:57,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:57,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164249717] [2022-11-19 07:18:57,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:57,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:57,474 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-19 07:18:57,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:57,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164249717] [2022-11-19 07:18:57,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164249717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:57,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:57,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:18:57,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190448001] [2022-11-19 07:18:57,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:57,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:18:57,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:57,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:18:57,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:57,477 INFO L87 Difference]: Start difference. First operand 9070 states and 42508 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:57,804 INFO L93 Difference]: Finished difference Result 7515 states and 35043 transitions. [2022-11-19 07:18:57,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:18:57,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-19 07:18:57,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:57,885 INFO L225 Difference]: With dead ends: 7515 [2022-11-19 07:18:57,885 INFO L226 Difference]: Without dead ends: 7515 [2022-11-19 07:18:57,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:57,887 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:57,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 3 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:18:57,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7515 states. [2022-11-19 07:18:58,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7515 to 7515. [2022-11-19 07:18:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7515 states, 7499 states have (on average 4.673023069742633) internal successors, (35043), 7514 states have internal predecessors, (35043), 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-19 07:18:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7515 states to 7515 states and 35043 transitions. [2022-11-19 07:18:58,409 INFO L78 Accepts]: Start accepts. Automaton has 7515 states and 35043 transitions. Word has length 2 [2022-11-19 07:18:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:58,410 INFO L495 AbstractCegarLoop]: Abstraction has 7515 states and 35043 transitions. [2022-11-19 07:18:58,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:18:58,410 INFO L276 IsEmpty]: Start isEmpty. Operand 7515 states and 35043 transitions. [2022-11-19 07:18:58,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-19 07:18:58,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:58,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-19 07:18:58,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 07:18:58,411 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-19 07:18:58,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:58,412 INFO L85 PathProgramCache]: Analyzing trace with hash 43766961, now seen corresponding path program 1 times [2022-11-19 07:18:58,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:58,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414685633] [2022-11-19 07:18:58,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:58,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:18:58,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:58,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414685633] [2022-11-19 07:18:58,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414685633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:58,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:58,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:18:58,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677207541] [2022-11-19 07:18:58,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:58,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:18:58,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:58,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:18:58,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:58,561 INFO L87 Difference]: Start difference. First operand 7515 states and 35043 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:58,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:58,696 INFO L93 Difference]: Finished difference Result 6460 states and 29327 transitions. [2022-11-19 07:18:58,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:18:58,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-19 07:18:58,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:58,841 INFO L225 Difference]: With dead ends: 6460 [2022-11-19 07:18:58,841 INFO L226 Difference]: Without dead ends: 6460 [2022-11-19 07:18:58,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:58,843 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:58,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 6 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:18:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2022-11-19 07:18:59,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 6460. [2022-11-19 07:18:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6460 states, 6445 states have (on average 4.550349107835531) internal successors, (29327), 6459 states have internal predecessors, (29327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6460 states to 6460 states and 29327 transitions. [2022-11-19 07:18:59,179 INFO L78 Accepts]: Start accepts. Automaton has 6460 states and 29327 transitions. Word has length 4 [2022-11-19 07:18:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:59,179 INFO L495 AbstractCegarLoop]: Abstraction has 6460 states and 29327 transitions. [2022-11-19 07:18:59,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 29327 transitions. [2022-11-19 07:18:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:18:59,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:59,180 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:18:59,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-19 07:18:59,181 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-19 07:18:59,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:59,181 INFO L85 PathProgramCache]: Analyzing trace with hash 203566247, now seen corresponding path program 1 times [2022-11-19 07:18:59,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:59,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466161759] [2022-11-19 07:18:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:59,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:18:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:18:59,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:18:59,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466161759] [2022-11-19 07:18:59,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466161759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:18:59,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:18:59,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:18:59,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406336498] [2022-11-19 07:18:59,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:18:59,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:18:59,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:18:59,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:18:59,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:18:59,241 INFO L87 Difference]: Start difference. First operand 6460 states and 29327 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:59,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:18:59,334 INFO L93 Difference]: Finished difference Result 3748 states and 17343 transitions. [2022-11-19 07:18:59,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:18:59,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-19 07:18:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:18:59,362 INFO L225 Difference]: With dead ends: 3748 [2022-11-19 07:18:59,362 INFO L226 Difference]: Without dead ends: 3748 [2022-11-19 07:18:59,363 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-19 07:18:59,363 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:18:59,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:18:59,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2022-11-19 07:18:59,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 3748. [2022-11-19 07:18:59,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3748 states, 3747 states have (on average 4.628502802241793) internal successors, (17343), 3747 states have internal predecessors, (17343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3748 states to 3748 states and 17343 transitions. [2022-11-19 07:18:59,535 INFO L78 Accepts]: Start accepts. Automaton has 3748 states and 17343 transitions. Word has length 11 [2022-11-19 07:18:59,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:18:59,536 INFO L495 AbstractCegarLoop]: Abstraction has 3748 states and 17343 transitions. [2022-11-19 07:18:59,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:18:59,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3748 states and 17343 transitions. [2022-11-19 07:18:59,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 07:18:59,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:18:59,539 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-19 07:18:59,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-19 07:18:59,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-19 07:18:59,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:18:59,540 INFO L85 PathProgramCache]: Analyzing trace with hash -25200554, now seen corresponding path program 1 times [2022-11-19 07:18:59,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:18:59,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008458612] [2022-11-19 07:18:59,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:18:59,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:18:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:18:59,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:18:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:18:59,583 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:18:59,584 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:18:59,584 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2022-11-19 07:18:59,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 9 remaining) [2022-11-19 07:18:59,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (6 of 9 remaining) [2022-11-19 07:18:59,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2022-11-19 07:18:59,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2022-11-19 07:18:59,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2022-11-19 07:18:59,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2022-11-19 07:18:59,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2022-11-19 07:18:59,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2022-11-19 07:18:59,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-19 07:18:59,587 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-19 07:18:59,589 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-19 07:18:59,589 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2022-11-19 07:18:59,681 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:18:59,685 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:18:59,685 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 235 transitions, 515 flow [2022-11-19 07:18:59,687 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 235 transitions, 515 flow [2022-11-19 07:18:59,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 235 transitions, 515 flow [2022-11-19 07:18:59,746 INFO L130 PetriNetUnfolder]: 16/323 cut-off events. [2022-11-19 07:18:59,746 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-19 07:18:59,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 323 events. 16/323 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1111 event pairs, 0 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 278. Up to 12 conditions per place. [2022-11-19 07:18:59,768 INFO L119 LiptonReduction]: Number of co-enabled transitions 38610 [2022-11-19 07:19:05,229 INFO L134 LiptonReduction]: Checked pairs total: 45499 [2022-11-19 07:19:05,229 INFO L136 LiptonReduction]: Total number of compositions: 237 [2022-11-19 07:19:05,230 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 49 transitions, 143 flow [2022-11-19 07:19:08,949 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 81058 states, 80780 states have (on average 6.525427085912354) internal successors, (527124), 81057 states have internal predecessors, (527124), 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-19 07:19:08,963 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:19:08,963 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@6bc9e352, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:19:08,964 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-19 07:19:09,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 81058 states, 80780 states have (on average 6.525427085912354) internal successors, (527124), 81057 states have internal predecessors, (527124), 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-19 07:19:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-19 07:19:09,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:19:09,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-19 07:19:09,079 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-19 07:19:09,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:19:09,080 INFO L85 PathProgramCache]: Analyzing trace with hash 61896, now seen corresponding path program 1 times [2022-11-19 07:19:09,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:19:09,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443292495] [2022-11-19 07:19:09,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:09,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:19:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:09,098 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-19 07:19:09,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:19:09,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443292495] [2022-11-19 07:19:09,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443292495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:19:09,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:19:09,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:19:09,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607454696] [2022-11-19 07:19:09,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:19:09,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:19:09,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:19:09,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:19:09,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:19:09,221 INFO L87 Difference]: Start difference. First operand has 81058 states, 80780 states have (on average 6.525427085912354) internal successors, (527124), 81057 states have internal predecessors, (527124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:19:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:19:10,800 INFO L93 Difference]: Finished difference Result 54430 states and 309484 transitions. [2022-11-19 07:19:10,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:19:10,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-19 07:19:10,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:19:11,501 INFO L225 Difference]: With dead ends: 54430 [2022-11-19 07:19:11,502 INFO L226 Difference]: Without dead ends: 54430 [2022-11-19 07:19:11,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:19:11,503 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:19:11,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:19:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54430 states. [2022-11-19 07:19:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54430 to 54430. [2022-11-19 07:19:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54430 states, 54335 states have (on average 5.695849820557652) internal successors, (309484), 54429 states have internal predecessors, (309484), 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-19 07:19:15,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54430 states to 54430 states and 309484 transitions. [2022-11-19 07:19:15,337 INFO L78 Accepts]: Start accepts. Automaton has 54430 states and 309484 transitions. Word has length 2 [2022-11-19 07:19:15,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:19:15,337 INFO L495 AbstractCegarLoop]: Abstraction has 54430 states and 309484 transitions. [2022-11-19 07:19:15,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:19:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand 54430 states and 309484 transitions. [2022-11-19 07:19:15,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-19 07:19:15,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:19:15,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-19 07:19:15,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-19 07:19:15,339 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-19 07:19:15,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:19:15,340 INFO L85 PathProgramCache]: Analyzing trace with hash 61897, now seen corresponding path program 1 times [2022-11-19 07:19:15,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:19:15,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920552521] [2022-11-19 07:19:15,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:15,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:19:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:15,387 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-19 07:19:15,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:19:15,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920552521] [2022-11-19 07:19:15,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920552521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:19:15,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:19:15,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:19:15,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42443097] [2022-11-19 07:19:15,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:19:15,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:19:15,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:19:15,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:19:15,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:19:15,390 INFO L87 Difference]: Start difference. First operand 54430 states and 309484 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:19:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:19:16,022 INFO L93 Difference]: Finished difference Result 45099 states and 255363 transitions. [2022-11-19 07:19:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:19:16,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-19 07:19:16,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:19:16,410 INFO L225 Difference]: With dead ends: 45099 [2022-11-19 07:19:16,410 INFO L226 Difference]: Without dead ends: 45099 [2022-11-19 07:19:16,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:19:16,411 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:19:16,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:19:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45099 states. [2022-11-19 07:19:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45099 to 45099. [2022-11-19 07:19:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45099 states, 45067 states have (on average 5.666296846916813) internal successors, (255363), 45098 states have internal predecessors, (255363), 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-19 07:19:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45099 states to 45099 states and 255363 transitions. [2022-11-19 07:19:18,722 INFO L78 Accepts]: Start accepts. Automaton has 45099 states and 255363 transitions. Word has length 2 [2022-11-19 07:19:18,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:19:18,722 INFO L495 AbstractCegarLoop]: Abstraction has 45099 states and 255363 transitions. [2022-11-19 07:19:18,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-19 07:19:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 45099 states and 255363 transitions. [2022-11-19 07:19:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-19 07:19:18,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:19:18,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-19 07:19:18,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-19 07:19:18,723 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-19 07:19:18,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:19:18,724 INFO L85 PathProgramCache]: Analyzing trace with hash 59534721, now seen corresponding path program 1 times [2022-11-19 07:19:18,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:19:18,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325111978] [2022-11-19 07:19:18,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:18,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:19:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:18,757 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-19 07:19:18,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:19:18,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325111978] [2022-11-19 07:19:18,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325111978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:19:18,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:19:18,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:19:18,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166419334] [2022-11-19 07:19:18,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:19:18,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:19:18,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:19:18,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:19:18,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:19:18,761 INFO L87 Difference]: Start difference. First operand 45099 states and 255363 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:19:19,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:19:19,771 INFO L93 Difference]: Finished difference Result 40314 states and 223471 transitions. [2022-11-19 07:19:19,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:19:19,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-19 07:19:19,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:19:19,989 INFO L225 Difference]: With dead ends: 40314 [2022-11-19 07:19:19,989 INFO L226 Difference]: Without dead ends: 40314 [2022-11-19 07:19:19,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:19:19,991 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:19:19,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 6 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:19:20,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40314 states. [2022-11-19 07:19:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40314 to 40314. [2022-11-19 07:19:21,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40314 states, 40283 states have (on average 5.547526251768736) internal successors, (223471), 40313 states have internal predecessors, (223471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:19:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40314 states to 40314 states and 223471 transitions. [2022-11-19 07:19:21,927 INFO L78 Accepts]: Start accepts. Automaton has 40314 states and 223471 transitions. Word has length 4 [2022-11-19 07:19:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:19:21,927 INFO L495 AbstractCegarLoop]: Abstraction has 40314 states and 223471 transitions. [2022-11-19 07:19:21,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:19:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 40314 states and 223471 transitions. [2022-11-19 07:19:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:19:21,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:19:21,928 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:19:21,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-19 07:19:21,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-19 07:19:21,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:19:21,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1554871629, now seen corresponding path program 1 times [2022-11-19 07:19:21,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:19:21,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019020904] [2022-11-19 07:19:21,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:21,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:19:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:19:21,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:19:21,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019020904] [2022-11-19 07:19:21,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019020904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:19:21,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:19:21,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:19:21,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441054024] [2022-11-19 07:19:21,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:19:21,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:19:21,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:19:21,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:19:21,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:19:21,980 INFO L87 Difference]: Start difference. First operand 40314 states and 223471 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:19:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:19:22,807 INFO L93 Difference]: Finished difference Result 18748 states and 105468 transitions. [2022-11-19 07:19:22,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:19:22,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-19 07:19:22,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:19:22,942 INFO L225 Difference]: With dead ends: 18748 [2022-11-19 07:19:22,942 INFO L226 Difference]: Without dead ends: 18748 [2022-11-19 07:19:22,943 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-19 07:19:22,945 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:19:22,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:19:22,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18748 states. [2022-11-19 07:19:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18748 to 18748. [2022-11-19 07:19:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18748 states, 18747 states have (on average 5.62586013762202) internal successors, (105468), 18747 states have internal predecessors, (105468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:19:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18748 states to 18748 states and 105468 transitions. [2022-11-19 07:19:23,513 INFO L78 Accepts]: Start accepts. Automaton has 18748 states and 105468 transitions. Word has length 11 [2022-11-19 07:19:23,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:19:23,513 INFO L495 AbstractCegarLoop]: Abstraction has 18748 states and 105468 transitions. [2022-11-19 07:19:23,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:19:23,514 INFO L276 IsEmpty]: Start isEmpty. Operand 18748 states and 105468 transitions. [2022-11-19 07:19:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:19:23,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:19:23,521 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:19:23,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-19 07:19:23,522 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-19 07:19:23,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:19:23,522 INFO L85 PathProgramCache]: Analyzing trace with hash 73879913, now seen corresponding path program 1 times [2022-11-19 07:19:23,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:19:23,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074677035] [2022-11-19 07:19:23,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:23,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:19:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:19:23,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:19:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:19:23,551 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:19:23,551 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:19:23,551 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2022-11-19 07:19:23,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-19 07:19:23,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (7 of 10 remaining) [2022-11-19 07:19:23,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-19 07:19:23,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-19 07:19:23,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 10 remaining) [2022-11-19 07:19:23,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-19 07:19:23,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 10 remaining) [2022-11-19 07:19:23,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 10 remaining) [2022-11-19 07:19:23,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-19 07:19:23,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-19 07:19:23,554 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-19 07:19:23,554 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-19 07:19:23,554 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2022-11-19 07:19:23,587 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:19:23,590 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:19:23,590 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 275 transitions, 610 flow [2022-11-19 07:19:23,591 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 275 places, 275 transitions, 610 flow [2022-11-19 07:19:23,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 275 transitions, 610 flow [2022-11-19 07:19:23,670 INFO L130 PetriNetUnfolder]: 19/381 cut-off events. [2022-11-19 07:19:23,671 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-11-19 07:19:23,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 381 events. 19/381 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1371 event pairs, 0 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 342. Up to 14 conditions per place. [2022-11-19 07:19:23,701 INFO L119 LiptonReduction]: Number of co-enabled transitions 55692 [2022-11-19 07:19:30,476 INFO L134 LiptonReduction]: Checked pairs total: 64516 [2022-11-19 07:19:30,476 INFO L136 LiptonReduction]: Total number of compositions: 276 [2022-11-19 07:19:30,477 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 57 transitions, 174 flow