./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/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_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/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_6bf1f064-36c2-475a-badc-a00f2248426e/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 a9552a698db9701543deeff63aa990ab8fc4764b65dba5035623425bdf77554d --- 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:41:48,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:41:48,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:41:48,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:41:48,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:41:48,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:41:48,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:41:48,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:41:48,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:41:48,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:41:48,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:41:48,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:41:48,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:41:48,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:41:48,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:41:48,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:41:48,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:41:48,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:41:48,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:41:48,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:41:48,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:41:48,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:41:48,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:41:48,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:41:48,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:41:48,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:41:48,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:41:48,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:41:48,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:41:48,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:41:48,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:41:48,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:41:48,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:41:48,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:41:48,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:41:48,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:41:48,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:41:48,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:41:48,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:41:48,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:41:48,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:41:48,608 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 07:41:48,632 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:41:48,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:41:48,632 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:41:48,632 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:41:48,633 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:41:48,633 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:41:48,633 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:41:48,634 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:41:48,634 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:41:48,634 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:41:48,634 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:41:48,634 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:41:48,634 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:41:48,635 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:41:48,635 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:41:48,635 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:41:48,635 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:41:48,635 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:41:48,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:41:48,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:41:48,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:41:48,636 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:41:48,637 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:41:48,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:41:48,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:41:48,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:41:48,637 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:41:48,638 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:41:48,638 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:41:48,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:41:48,638 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:41:48,638 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:41:48,638 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:41:48,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:41:48,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:41:48,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:41:48,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:41:48,639 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:41:48,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:41:48,640 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:41:48,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:41:48,640 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:41:48,640 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_6bf1f064-36c2-475a-badc-a00f2248426e/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_6bf1f064-36c2-475a-badc-a00f2248426e/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 -> a9552a698db9701543deeff63aa990ab8fc4764b65dba5035623425bdf77554d [2022-11-19 07:41:48,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:41:48,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:41:48,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:41:48,904 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:41:48,905 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:41:48,906 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i [2022-11-19 07:41:48,978 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/data/35c37b4ae/c339407bb95547559cce7a208f4d1edc/FLAGb1dd7cd77 [2022-11-19 07:41:49,617 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:41:49,618 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i [2022-11-19 07:41:49,646 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/data/35c37b4ae/c339407bb95547559cce7a208f4d1edc/FLAGb1dd7cd77 [2022-11-19 07:41:49,866 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/data/35c37b4ae/c339407bb95547559cce7a208f4d1edc [2022-11-19 07:41:49,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:41:49,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:41:49,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:41:49,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:41:49,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:41:49,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:49" (1/1) ... [2022-11-19 07:41:49,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee9e54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:49, skipping insertion in model container [2022-11-19 07:41:49,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:49" (1/1) ... [2022-11-19 07:41:49,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:41:49,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:41:50,607 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_6bf1f064-36c2-475a-badc-a00f2248426e/sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i[76081,76094] [2022-11-19 07:41:50,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:41:50,683 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:41:50,761 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_6bf1f064-36c2-475a-badc-a00f2248426e/sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i[76081,76094] [2022-11-19 07:41:50,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:41:50,889 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:41:50,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:50 WrapperNode [2022-11-19 07:41:50,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:41:50,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:41:50,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:41:50,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:41:50,897 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:41:50" (1/1) ... [2022-11-19 07:41:50,930 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:41:50" (1/1) ... [2022-11-19 07:41:50,971 INFO L138 Inliner]: procedures = 486, calls = 43, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 201 [2022-11-19 07:41:50,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:41:50,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:41:50,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:41:50,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:41:50,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:50" (1/1) ... [2022-11-19 07:41:50,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:50" (1/1) ... [2022-11-19 07:41:50,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:50" (1/1) ... [2022-11-19 07:41:50,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:50" (1/1) ... [2022-11-19 07:41:50,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:50" (1/1) ... [2022-11-19 07:41:51,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:50" (1/1) ... [2022-11-19 07:41:51,008 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:50" (1/1) ... [2022-11-19 07:41:51,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:50" (1/1) ... [2022-11-19 07:41:51,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:41:51,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:41:51,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:41:51,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:41:51,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:50" (1/1) ... [2022-11-19 07:41:51,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:41:51,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:41:51,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:41:51,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:41:51,111 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2022-11-19 07:41:51,111 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2022-11-19 07:41:51,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:41:51,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 07:41:51,112 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2022-11-19 07:41:51,112 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2022-11-19 07:41:51,112 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-19 07:41:51,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:41:51,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 07:41:51,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:41:51,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:41:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:41:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:41:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:41:51,114 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:41:51,522 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:41:51,524 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:41:51,933 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:41:51,948 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:41:51,948 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-19 07:41:51,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:51 BoogieIcfgContainer [2022-11-19 07:41:51,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:41:51,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:41:51,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:41:51,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:41:51,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:41:49" (1/3) ... [2022-11-19 07:41:51,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9199fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:51, skipping insertion in model container [2022-11-19 07:41:51,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:50" (2/3) ... [2022-11-19 07:41:51,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9199fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:51, skipping insertion in model container [2022-11-19 07:41:51,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:51" (3/3) ... [2022-11-19 07:41:51,962 INFO L112 eAbstractionObserver]: Analyzing ICFG race-4_1-thread_local_vars.i [2022-11-19 07:41:51,988 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:41:51,988 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2022-11-19 07:41:51,990 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:41:52,083 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2022-11-19 07:41:52,118 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:41:52,133 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 323 places, 353 transitions, 736 flow [2022-11-19 07:41:52,136 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 323 places, 353 transitions, 736 flow [2022-11-19 07:41:52,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 323 places, 353 transitions, 736 flow [2022-11-19 07:41:52,294 INFO L130 PetriNetUnfolder]: 33/371 cut-off events. [2022-11-19 07:41:52,295 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-19 07:41:52,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 371 events. 33/371 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1009 event pairs, 0 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 243. Up to 11 conditions per place. [2022-11-19 07:41:52,316 INFO L119 LiptonReduction]: Number of co-enabled transitions 12794 [2022-11-19 07:42:06,533 INFO L134 LiptonReduction]: Checked pairs total: 18289 [2022-11-19 07:42:06,533 INFO L136 LiptonReduction]: Total number of compositions: 449 [2022-11-19 07:42:06,542 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 69 places, 78 transitions, 186 flow [2022-11-19 07:42:06,615 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1003 states, 860 states have (on average 3.3313953488372094) internal successors, (2865), 1002 states have internal predecessors, (2865), 0 states have call successors, (0), 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:42:06,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:42:06,639 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;@4c6c953e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:42:06,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-11-19 07:42:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 1003 states, 860 states have (on average 3.3313953488372094) internal successors, (2865), 1002 states have internal predecessors, (2865), 0 states have call successors, (0), 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:42:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 07:42:06,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:06,649 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 07:42:06,649 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:06,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:06,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1217, now seen corresponding path program 1 times [2022-11-19 07:42:06,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:06,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548408352] [2022-11-19 07:42:06,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:06,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:06,905 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:42:06,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:06,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548408352] [2022-11-19 07:42:06,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548408352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:06,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:06,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 07:42:06,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70699085] [2022-11-19 07:42:06,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:06,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:42:06,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:06,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:42:06,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:42:06,955 INFO L87 Difference]: Start difference. First operand has 1003 states, 860 states have (on average 3.3313953488372094) internal successors, (2865), 1002 states have internal predecessors, (2865), 0 states have call successors, (0), 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 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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:42:07,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:07,102 INFO L93 Difference]: Finished difference Result 989 states and 2772 transitions. [2022-11-19 07:42:07,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:42:07,105 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-19 07:42:07,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:07,134 INFO L225 Difference]: With dead ends: 989 [2022-11-19 07:42:07,137 INFO L226 Difference]: Without dead ends: 979 [2022-11-19 07:42:07,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 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:42:07,143 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:07,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:07,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2022-11-19 07:42:07,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 979. [2022-11-19 07:42:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 851 states have (on average 3.2326674500587544) internal successors, (2751), 978 states have internal predecessors, (2751), 0 states have call successors, (0), 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:42:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 2751 transitions. [2022-11-19 07:42:07,268 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 2751 transitions. Word has length 1 [2022-11-19 07:42:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:07,268 INFO L495 AbstractCegarLoop]: Abstraction has 979 states and 2751 transitions. [2022-11-19 07:42:07,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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:42:07,270 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 2751 transitions. [2022-11-19 07:42:07,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 07:42:07,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:07,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 07:42:07,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:42:07,283 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:07,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:07,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1206057, now seen corresponding path program 1 times [2022-11-19 07:42:07,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:07,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465416752] [2022-11-19 07:42:07,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:07,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:07,469 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:42:07,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:07,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465416752] [2022-11-19 07:42:07,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465416752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:07,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:07,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:42:07,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285562619] [2022-11-19 07:42:07,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:07,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:42:07,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:07,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:42:07,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:42:07,477 INFO L87 Difference]: Start difference. First operand 979 states and 2751 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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:42:07,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:07,620 INFO L93 Difference]: Finished difference Result 1349 states and 3880 transitions. [2022-11-19 07:42:07,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:42:07,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-19 07:42:07,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:07,629 INFO L225 Difference]: With dead ends: 1349 [2022-11-19 07:42:07,629 INFO L226 Difference]: Without dead ends: 1346 [2022-11-19 07:42:07,629 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:42:07,630 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:07,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 20 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:07,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2022-11-19 07:42:07,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1168. [2022-11-19 07:42:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1040 states have (on average 3.2971153846153847) internal successors, (3429), 1167 states have internal predecessors, (3429), 0 states have call successors, (0), 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:42:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 3429 transitions. [2022-11-19 07:42:07,670 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 3429 transitions. Word has length 3 [2022-11-19 07:42:07,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:07,671 INFO L495 AbstractCegarLoop]: Abstraction has 1168 states and 3429 transitions. [2022-11-19 07:42:07,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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:42:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 3429 transitions. [2022-11-19 07:42:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 07:42:07,672 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:07,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 07:42:07,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:42:07,673 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:07,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:07,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1207298, now seen corresponding path program 1 times [2022-11-19 07:42:07,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:07,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395950506] [2022-11-19 07:42:07,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:07,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:07,813 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:42:07,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:07,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395950506] [2022-11-19 07:42:07,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395950506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:07,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:07,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:42:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764119004] [2022-11-19 07:42:07,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:07,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:42:07,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:07,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:42:07,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:42:07,817 INFO L87 Difference]: Start difference. First operand 1168 states and 3429 transitions. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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:42:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:07,916 INFO L93 Difference]: Finished difference Result 1165 states and 3426 transitions. [2022-11-19 07:42:07,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:42:07,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-19 07:42:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:07,926 INFO L225 Difference]: With dead ends: 1165 [2022-11-19 07:42:07,926 INFO L226 Difference]: Without dead ends: 1164 [2022-11-19 07:42:07,927 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:42:07,930 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:07,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:07,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2022-11-19 07:42:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1164. [2022-11-19 07:42:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1038 states have (on average 3.2996146435452793) internal successors, (3425), 1163 states have internal predecessors, (3425), 0 states have call successors, (0), 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:42:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 3425 transitions. [2022-11-19 07:42:07,975 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 3425 transitions. Word has length 3 [2022-11-19 07:42:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:07,975 INFO L495 AbstractCegarLoop]: Abstraction has 1164 states and 3425 transitions. [2022-11-19 07:42:07,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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:42:07,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 3425 transitions. [2022-11-19 07:42:07,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-19 07:42:07,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:07,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-19 07:42:07,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:42:07,977 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread_usbErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:07,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:07,977 INFO L85 PathProgramCache]: Analyzing trace with hash 37263449, now seen corresponding path program 1 times [2022-11-19 07:42:07,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:07,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569959013] [2022-11-19 07:42:07,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:07,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:08,077 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:42:08,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:08,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569959013] [2022-11-19 07:42:08,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569959013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:08,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:08,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:42:08,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387601429] [2022-11-19 07:42:08,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:08,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:42:08,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:08,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:42:08,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:42:08,080 INFO L87 Difference]: Start difference. First operand 1164 states and 3425 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:42:08,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:08,219 INFO L93 Difference]: Finished difference Result 1737 states and 4919 transitions. [2022-11-19 07:42:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:42:08,220 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:42:08,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:08,230 INFO L225 Difference]: With dead ends: 1737 [2022-11-19 07:42:08,230 INFO L226 Difference]: Without dead ends: 1737 [2022-11-19 07:42:08,231 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:42:08,231 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:08,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 10 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2022-11-19 07:42:08,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1254. [2022-11-19 07:42:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1128 states have (on average 3.400709219858156) internal successors, (3836), 1253 states have internal predecessors, (3836), 0 states have call successors, (0), 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:42:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 3836 transitions. [2022-11-19 07:42:08,276 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 3836 transitions. Word has length 4 [2022-11-19 07:42:08,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:08,277 INFO L495 AbstractCegarLoop]: Abstraction has 1254 states and 3836 transitions. [2022-11-19 07:42:08,277 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:42:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 3836 transitions. [2022-11-19 07:42:08,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-19 07:42:08,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:08,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-19 07:42:08,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:42:08,278 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread_usbErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:08,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:08,279 INFO L85 PathProgramCache]: Analyzing trace with hash 37263450, now seen corresponding path program 1 times [2022-11-19 07:42:08,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:08,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912634716] [2022-11-19 07:42:08,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:08,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:08,469 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:42:08,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:08,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912634716] [2022-11-19 07:42:08,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912634716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:08,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:08,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:42:08,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147678133] [2022-11-19 07:42:08,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:08,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:42:08,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:08,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:42:08,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:42:08,474 INFO L87 Difference]: Start difference. First operand 1254 states and 3836 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:42:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:08,569 INFO L93 Difference]: Finished difference Result 1116 states and 3415 transitions. [2022-11-19 07:42:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:42:08,570 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:42:08,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:08,577 INFO L225 Difference]: With dead ends: 1116 [2022-11-19 07:42:08,577 INFO L226 Difference]: Without dead ends: 1113 [2022-11-19 07:42:08,577 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:42:08,578 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:08,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 7 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:08,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2022-11-19 07:42:08,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2022-11-19 07:42:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1017 states have (on average 3.3490658800393316) internal successors, (3406), 1112 states have internal predecessors, (3406), 0 states have call successors, (0), 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:42:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 3406 transitions. [2022-11-19 07:42:08,625 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 3406 transitions. Word has length 4 [2022-11-19 07:42:08,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:08,625 INFO L495 AbstractCegarLoop]: Abstraction has 1113 states and 3406 transitions. [2022-11-19 07:42:08,625 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:42:08,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 3406 transitions. [2022-11-19 07:42:08,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 07:42:08,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:08,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 07:42:08,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:42:08,627 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:08,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:08,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1155263549, now seen corresponding path program 1 times [2022-11-19 07:42:08,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:08,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537254603] [2022-11-19 07:42:08,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:08,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:08,788 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:42:08,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:08,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537254603] [2022-11-19 07:42:08,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537254603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:08,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:08,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:42:08,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70753932] [2022-11-19 07:42:08,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:08,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:42:08,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:08,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:42:08,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:42:08,792 INFO L87 Difference]: Start difference. First operand 1113 states and 3406 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:42:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:09,000 INFO L93 Difference]: Finished difference Result 1536 states and 4279 transitions. [2022-11-19 07:42:09,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:42:09,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-19 07:42:09,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:09,010 INFO L225 Difference]: With dead ends: 1536 [2022-11-19 07:42:09,010 INFO L226 Difference]: Without dead ends: 1536 [2022-11-19 07:42:09,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:42:09,011 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 66 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:09,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 17 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:42:09,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2022-11-19 07:42:09,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1176. [2022-11-19 07:42:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1080 states have (on average 3.3222222222222224) internal successors, (3588), 1175 states have internal predecessors, (3588), 0 states have call successors, (0), 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:42:09,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 3588 transitions. [2022-11-19 07:42:09,052 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 3588 transitions. Word has length 5 [2022-11-19 07:42:09,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:09,052 INFO L495 AbstractCegarLoop]: Abstraction has 1176 states and 3588 transitions. [2022-11-19 07:42:09,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:42:09,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 3588 transitions. [2022-11-19 07:42:09,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 07:42:09,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:09,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 07:42:09,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:42:09,055 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:09,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:09,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1155263550, now seen corresponding path program 1 times [2022-11-19 07:42:09,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:09,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768417652] [2022-11-19 07:42:09,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:09,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:42:09,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:09,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768417652] [2022-11-19 07:42:09,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768417652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:09,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:09,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:42:09,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103624128] [2022-11-19 07:42:09,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:09,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:42:09,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:09,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:42:09,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:42:09,243 INFO L87 Difference]: Start difference. First operand 1176 states and 3588 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:42:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:09,383 INFO L93 Difference]: Finished difference Result 1279 states and 3612 transitions. [2022-11-19 07:42:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:42:09,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-19 07:42:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:09,391 INFO L225 Difference]: With dead ends: 1279 [2022-11-19 07:42:09,391 INFO L226 Difference]: Without dead ends: 1277 [2022-11-19 07:42:09,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:42:09,392 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 110 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:09,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 4 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:09,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2022-11-19 07:42:09,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1075. [2022-11-19 07:42:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 997 states have (on average 3.220661985957874) internal successors, (3211), 1074 states have internal predecessors, (3211), 0 states have call successors, (0), 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:42:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 3211 transitions. [2022-11-19 07:42:09,428 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 3211 transitions. Word has length 5 [2022-11-19 07:42:09,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:09,429 INFO L495 AbstractCegarLoop]: Abstraction has 1075 states and 3211 transitions. [2022-11-19 07:42:09,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:42:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 3211 transitions. [2022-11-19 07:42:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 07:42:09,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:09,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 07:42:09,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:42:09,430 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread_usbErr7ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:09,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1450401026, now seen corresponding path program 1 times [2022-11-19 07:42:09,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:09,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464592804] [2022-11-19 07:42:09,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:09,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:09,508 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:42:09,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:09,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464592804] [2022-11-19 07:42:09,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464592804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:09,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:09,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:42:09,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988911487] [2022-11-19 07:42:09,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:09,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:42:09,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:09,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:42:09,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:42:09,511 INFO L87 Difference]: Start difference. First operand 1075 states and 3211 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:09,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:09,671 INFO L93 Difference]: Finished difference Result 1400 states and 4010 transitions. [2022-11-19 07:42:09,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:42:09,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-19 07:42:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:09,679 INFO L225 Difference]: With dead ends: 1400 [2022-11-19 07:42:09,680 INFO L226 Difference]: Without dead ends: 1381 [2022-11-19 07:42:09,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:42:09,681 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 70 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:09,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 55 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2022-11-19 07:42:09,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1141. [2022-11-19 07:42:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1067 states have (on average 3.1930646672914715) internal successors, (3407), 1140 states have internal predecessors, (3407), 0 states have call successors, (0), 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:42:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 3407 transitions. [2022-11-19 07:42:09,719 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 3407 transitions. Word has length 6 [2022-11-19 07:42:09,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:09,719 INFO L495 AbstractCegarLoop]: Abstraction has 1141 states and 3407 transitions. [2022-11-19 07:42:09,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 3407 transitions. [2022-11-19 07:42:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 07:42:09,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:09,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:09,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:42:09,721 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:09,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:09,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2013575791, now seen corresponding path program 1 times [2022-11-19 07:42:09,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:09,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369101580] [2022-11-19 07:42:09,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:09,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:09,772 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:42:09,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:09,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369101580] [2022-11-19 07:42:09,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369101580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:09,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:09,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:42:09,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630297856] [2022-11-19 07:42:09,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:09,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:42:09,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:09,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:42:09,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:42:09,774 INFO L87 Difference]: Start difference. First operand 1141 states and 3407 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:42:09,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:09,879 INFO L93 Difference]: Finished difference Result 1157 states and 3489 transitions. [2022-11-19 07:42:09,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:42:09,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-19 07:42:09,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:09,886 INFO L225 Difference]: With dead ends: 1157 [2022-11-19 07:42:09,886 INFO L226 Difference]: Without dead ends: 1157 [2022-11-19 07:42:09,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:42:09,887 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:09,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 20 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:09,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-11-19 07:42:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1153. [2022-11-19 07:42:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1079 states have (on average 3.2187210379981464) internal successors, (3473), 1152 states have internal predecessors, (3473), 0 states have call successors, (0), 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:42:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 3473 transitions. [2022-11-19 07:42:09,924 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 3473 transitions. Word has length 7 [2022-11-19 07:42:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:09,924 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 3473 transitions. [2022-11-19 07:42:09,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:42:09,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 3473 transitions. [2022-11-19 07:42:09,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-19 07:42:09,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:09,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:09,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:42:09,926 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:09,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:09,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1973465657, now seen corresponding path program 1 times [2022-11-19 07:42:09,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:09,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080769116] [2022-11-19 07:42:09,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:09,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:10,009 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:42:10,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:10,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080769116] [2022-11-19 07:42:10,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080769116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:10,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:10,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:42:10,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118958476] [2022-11-19 07:42:10,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:10,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:42:10,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:10,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:42:10,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:42:10,011 INFO L87 Difference]: Start difference. First operand 1153 states and 3473 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:10,108 INFO L93 Difference]: Finished difference Result 1033 states and 3009 transitions. [2022-11-19 07:42:10,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:42:10,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-19 07:42:10,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:10,114 INFO L225 Difference]: With dead ends: 1033 [2022-11-19 07:42:10,115 INFO L226 Difference]: Without dead ends: 1001 [2022-11-19 07:42:10,115 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:42:10,116 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:10,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 30 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:10,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2022-11-19 07:42:10,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2022-11-19 07:42:10,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 923 states have (on average 3.1473456121343446) internal successors, (2905), 1000 states have internal predecessors, (2905), 0 states have call successors, (0), 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:42:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 2905 transitions. [2022-11-19 07:42:10,145 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 2905 transitions. Word has length 8 [2022-11-19 07:42:10,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:10,146 INFO L495 AbstractCegarLoop]: Abstraction has 1001 states and 2905 transitions. [2022-11-19 07:42:10,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:10,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 2905 transitions. [2022-11-19 07:42:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 07:42:10,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:10,148 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:10,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:42:10,148 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread_usbThread1of1ForFork0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:10,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1032760328, now seen corresponding path program 1 times [2022-11-19 07:42:10,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:10,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536904920] [2022-11-19 07:42:10,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:10,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:10,206 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:42:10,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:10,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536904920] [2022-11-19 07:42:10,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536904920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:10,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:10,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:42:10,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285167797] [2022-11-19 07:42:10,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:10,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:42:10,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:10,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:42:10,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:42:10,209 INFO L87 Difference]: Start difference. First operand 1001 states and 2905 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:10,286 INFO L93 Difference]: Finished difference Result 865 states and 2318 transitions. [2022-11-19 07:42:10,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:42:10,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-19 07:42:10,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:10,292 INFO L225 Difference]: With dead ends: 865 [2022-11-19 07:42:10,292 INFO L226 Difference]: Without dead ends: 855 [2022-11-19 07:42:10,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:42:10,293 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:10,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 21 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:10,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-11-19 07:42:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2022-11-19 07:42:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 793 states have (on average 2.8827238335435057) internal successors, (2286), 854 states have internal predecessors, (2286), 0 states have call successors, (0), 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:42:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 2286 transitions. [2022-11-19 07:42:10,317 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 2286 transitions. Word has length 9 [2022-11-19 07:42:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:10,317 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 2286 transitions. [2022-11-19 07:42:10,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 2286 transitions. [2022-11-19 07:42:10,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 07:42:10,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:10,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:10,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:42:10,319 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:10,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:10,319 INFO L85 PathProgramCache]: Analyzing trace with hash -666302875, now seen corresponding path program 1 times [2022-11-19 07:42:10,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:10,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093937824] [2022-11-19 07:42:10,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:10,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:42:10,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:10,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093937824] [2022-11-19 07:42:10,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093937824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:10,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:10,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:42:10,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637535403] [2022-11-19 07:42:10,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:10,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:42:10,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:10,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:42:10,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:42:10,406 INFO L87 Difference]: Start difference. First operand 855 states and 2286 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:10,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:10,503 INFO L93 Difference]: Finished difference Result 565 states and 1435 transitions. [2022-11-19 07:42:10,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:42:10,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-19 07:42:10,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:10,507 INFO L225 Difference]: With dead ends: 565 [2022-11-19 07:42:10,507 INFO L226 Difference]: Without dead ends: 553 [2022-11-19 07:42:10,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:42:10,508 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:10,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 24 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:10,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-11-19 07:42:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2022-11-19 07:42:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 514 states have (on average 2.737354085603113) internal successors, (1407), 552 states have internal predecessors, (1407), 0 states have call successors, (0), 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:42:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 1407 transitions. [2022-11-19 07:42:10,528 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 1407 transitions. Word has length 9 [2022-11-19 07:42:10,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:10,529 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 1407 transitions. [2022-11-19 07:42:10,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 1407 transitions. [2022-11-19 07:42:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 07:42:10,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:10,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:10,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:42:10,531 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:10,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:10,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1965687421, now seen corresponding path program 1 times [2022-11-19 07:42:10,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:10,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506399677] [2022-11-19 07:42:10,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:10,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:10,613 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:42:10,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:10,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506399677] [2022-11-19 07:42:10,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506399677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:10,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:10,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:42:10,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799279032] [2022-11-19 07:42:10,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:10,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:42:10,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:10,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:42:10,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:42:10,615 INFO L87 Difference]: Start difference. First operand 553 states and 1407 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) 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:42:10,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:10,692 INFO L93 Difference]: Finished difference Result 321 states and 783 transitions. [2022-11-19 07:42:10,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:42:10,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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 10 [2022-11-19 07:42:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:10,694 INFO L225 Difference]: With dead ends: 321 [2022-11-19 07:42:10,695 INFO L226 Difference]: Without dead ends: 313 [2022-11-19 07:42:10,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:42:10,696 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:10,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 20 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-11-19 07:42:10,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 291. [2022-11-19 07:42:10,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 272 states have (on average 2.7058823529411766) internal successors, (736), 290 states have internal predecessors, (736), 0 states have call successors, (0), 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:42:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 736 transitions. [2022-11-19 07:42:10,705 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 736 transitions. Word has length 10 [2022-11-19 07:42:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:10,705 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 736 transitions. [2022-11-19 07:42:10,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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:42:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 736 transitions. [2022-11-19 07:42:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:42:10,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:10,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:10,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 07:42:10,707 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:10,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2015576476, now seen corresponding path program 1 times [2022-11-19 07:42:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:10,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328296378] [2022-11-19 07:42:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:10,784 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:42:10,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:10,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328296378] [2022-11-19 07:42:10,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328296378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:10,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:10,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:42:10,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466393124] [2022-11-19 07:42:10,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:10,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:42:10,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:10,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:42:10,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:42:10,787 INFO L87 Difference]: Start difference. First operand 291 states and 736 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:42:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:10,890 INFO L93 Difference]: Finished difference Result 406 states and 1012 transitions. [2022-11-19 07:42:10,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:42:10,891 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:42:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:10,893 INFO L225 Difference]: With dead ends: 406 [2022-11-19 07:42:10,893 INFO L226 Difference]: Without dead ends: 406 [2022-11-19 07:42:10,893 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:42:10,894 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 26 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:10,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 11 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-11-19 07:42:10,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 302. [2022-11-19 07:42:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 283 states have (on average 2.7137809187279154) internal successors, (768), 301 states have internal predecessors, (768), 0 states have call successors, (0), 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:42:10,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 768 transitions. [2022-11-19 07:42:10,905 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 768 transitions. Word has length 11 [2022-11-19 07:42:10,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:10,906 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 768 transitions. [2022-11-19 07:42:10,906 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:42:10,906 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 768 transitions. [2022-11-19 07:42:10,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:42:10,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:10,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:10,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 07:42:10,912 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:10,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:10,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2015576477, now seen corresponding path program 1 times [2022-11-19 07:42:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:10,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425979154] [2022-11-19 07:42:10,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:10,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:11,039 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:42:11,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:11,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425979154] [2022-11-19 07:42:11,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425979154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:11,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:11,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:42:11,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034703621] [2022-11-19 07:42:11,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:11,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:42:11,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:11,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:42:11,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:42:11,042 INFO L87 Difference]: Start difference. First operand 302 states and 768 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:42:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:11,142 INFO L93 Difference]: Finished difference Result 301 states and 766 transitions. [2022-11-19 07:42:11,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:42:11,143 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:42:11,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:11,145 INFO L225 Difference]: With dead ends: 301 [2022-11-19 07:42:11,145 INFO L226 Difference]: Without dead ends: 301 [2022-11-19 07:42:11,147 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:42:11,148 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:11,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 11 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-11-19 07:42:11,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2022-11-19 07:42:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 283 states have (on average 2.706713780918728) internal successors, (766), 300 states have internal predecessors, (766), 0 states have call successors, (0), 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:42:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 766 transitions. [2022-11-19 07:42:11,157 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 766 transitions. Word has length 11 [2022-11-19 07:42:11,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:11,157 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 766 transitions. [2022-11-19 07:42:11,157 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:42:11,157 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 766 transitions. [2022-11-19 07:42:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:42:11,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:11,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:11,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 07:42:11,158 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:11,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:11,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1941616796, now seen corresponding path program 1 times [2022-11-19 07:42:11,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:11,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710976137] [2022-11-19 07:42:11,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:11,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:11,328 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:42:11,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:11,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710976137] [2022-11-19 07:42:11,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710976137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:11,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:11,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:42:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985116639] [2022-11-19 07:42:11,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:11,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:42:11,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:11,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:42:11,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:42:11,333 INFO L87 Difference]: Start difference. First operand 301 states and 766 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:11,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:11,448 INFO L93 Difference]: Finished difference Result 308 states and 772 transitions. [2022-11-19 07:42:11,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:42:11,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-19 07:42:11,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:11,450 INFO L225 Difference]: With dead ends: 308 [2022-11-19 07:42:11,450 INFO L226 Difference]: Without dead ends: 307 [2022-11-19 07:42:11,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:42:11,451 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:11,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 12 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:11,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-11-19 07:42:11,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-11-19 07:42:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 287 states have (on average 2.682926829268293) internal successors, (770), 304 states have internal predecessors, (770), 0 states have call successors, (0), 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:42:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 770 transitions. [2022-11-19 07:42:11,459 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 770 transitions. Word has length 12 [2022-11-19 07:42:11,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:11,460 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 770 transitions. [2022-11-19 07:42:11,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:11,460 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 770 transitions. [2022-11-19 07:42:11,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:42:11,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:11,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:11,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 07:42:11,461 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:11,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1941619849, now seen corresponding path program 1 times [2022-11-19 07:42:11,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:11,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942677740] [2022-11-19 07:42:11,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:11,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:11,542 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:42:11,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:11,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942677740] [2022-11-19 07:42:11,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942677740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:11,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:11,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:42:11,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607213804] [2022-11-19 07:42:11,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:11,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:42:11,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:11,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:42:11,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:42:11,545 INFO L87 Difference]: Start difference. First operand 305 states and 770 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:11,598 INFO L93 Difference]: Finished difference Result 304 states and 769 transitions. [2022-11-19 07:42:11,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:42:11,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-19 07:42:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:11,601 INFO L225 Difference]: With dead ends: 304 [2022-11-19 07:42:11,601 INFO L226 Difference]: Without dead ends: 286 [2022-11-19 07:42:11,601 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:42:11,602 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:11,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 15 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:42:11,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-19 07:42:11,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-11-19 07:42:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 269 states have (on average 2.724907063197026) internal successors, (733), 285 states have internal predecessors, (733), 0 states have call successors, (0), 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:42:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 733 transitions. [2022-11-19 07:42:11,610 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 733 transitions. Word has length 12 [2022-11-19 07:42:11,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:11,610 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 733 transitions. [2022-11-19 07:42:11,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 733 transitions. [2022-11-19 07:42:11,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:42:11,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:11,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:11,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 07:42:11,612 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread_usbErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:11,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:11,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1086285681, now seen corresponding path program 1 times [2022-11-19 07:42:11,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:11,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557459909] [2022-11-19 07:42:11,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:11,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:11,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:11,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557459909] [2022-11-19 07:42:11,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557459909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:11,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:11,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:42:11,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087335388] [2022-11-19 07:42:11,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:11,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:42:11,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:11,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:42:11,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:42:11,690 INFO L87 Difference]: Start difference. First operand 286 states and 733 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:11,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:11,757 INFO L93 Difference]: Finished difference Result 278 states and 718 transitions. [2022-11-19 07:42:11,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:42:11,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 07:42:11,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:11,759 INFO L225 Difference]: With dead ends: 278 [2022-11-19 07:42:11,759 INFO L226 Difference]: Without dead ends: 278 [2022-11-19 07:42:11,759 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:42:11,760 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:11,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 7 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-19 07:42:11,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2022-11-19 07:42:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 263 states have (on average 2.7300380228136882) internal successors, (718), 277 states have internal predecessors, (718), 0 states have call successors, (0), 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:42:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 718 transitions. [2022-11-19 07:42:11,768 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 718 transitions. Word has length 13 [2022-11-19 07:42:11,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:11,768 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 718 transitions. [2022-11-19 07:42:11,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:11,769 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 718 transitions. [2022-11-19 07:42:11,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:42:11,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:11,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:11,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-19 07:42:11,770 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread_usbErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:11,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:11,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1086285680, now seen corresponding path program 1 times [2022-11-19 07:42:11,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:11,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977017551] [2022-11-19 07:42:11,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:11,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:11,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:11,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977017551] [2022-11-19 07:42:11,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977017551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:11,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:11,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:42:11,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153631529] [2022-11-19 07:42:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:11,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:42:11,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:11,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:42:11,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:42:11,893 INFO L87 Difference]: Start difference. First operand 278 states and 718 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:11,968 INFO L93 Difference]: Finished difference Result 270 states and 703 transitions. [2022-11-19 07:42:11,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:42:11,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 07:42:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:11,970 INFO L225 Difference]: With dead ends: 270 [2022-11-19 07:42:11,970 INFO L226 Difference]: Without dead ends: 270 [2022-11-19 07:42:11,970 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:42:11,971 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:11,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-19 07:42:11,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-11-19 07:42:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 257 states have (on average 2.735408560311284) internal successors, (703), 269 states have internal predecessors, (703), 0 states have call successors, (0), 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:42:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 703 transitions. [2022-11-19 07:42:11,978 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 703 transitions. Word has length 13 [2022-11-19 07:42:11,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:11,979 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 703 transitions. [2022-11-19 07:42:11,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 703 transitions. [2022-11-19 07:42:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:42:11,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:11,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:11,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-19 07:42:11,980 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread_usbErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:11,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:11,981 INFO L85 PathProgramCache]: Analyzing trace with hash -243244008, now seen corresponding path program 1 times [2022-11-19 07:42:11,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:11,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264726033] [2022-11-19 07:42:11,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:11,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:12,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:12,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264726033] [2022-11-19 07:42:12,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264726033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:12,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:12,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:42:12,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286696797] [2022-11-19 07:42:12,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:12,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:42:12,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:12,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:42:12,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:42:12,135 INFO L87 Difference]: Start difference. First operand 270 states and 703 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:12,208 INFO L93 Difference]: Finished difference Result 240 states and 627 transitions. [2022-11-19 07:42:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:42:12,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 07:42:12,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:12,210 INFO L225 Difference]: With dead ends: 240 [2022-11-19 07:42:12,210 INFO L226 Difference]: Without dead ends: 236 [2022-11-19 07:42:12,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:42:12,211 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 39 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:12,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 5 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-19 07:42:12,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 226. [2022-11-19 07:42:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 221 states have (on average 2.678733031674208) internal successors, (592), 225 states have internal predecessors, (592), 0 states have call successors, (0), 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:42:12,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 592 transitions. [2022-11-19 07:42:12,218 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 592 transitions. Word has length 15 [2022-11-19 07:42:12,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:12,218 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 592 transitions. [2022-11-19 07:42:12,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 592 transitions. [2022-11-19 07:42:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:42:12,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:12,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:12,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-19 07:42:12,219 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:12,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:12,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1792863241, now seen corresponding path program 1 times [2022-11-19 07:42:12,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:12,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12187132] [2022-11-19 07:42:12,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:12,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:12,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:12,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12187132] [2022-11-19 07:42:12,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12187132] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:12,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:12,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:42:12,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822882288] [2022-11-19 07:42:12,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:12,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:42:12,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:12,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:42:12,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:42:12,544 INFO L87 Difference]: Start difference. First operand 226 states and 592 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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:42:12,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:12,629 INFO L93 Difference]: Finished difference Result 195 states and 500 transitions. [2022-11-19 07:42:12,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:42:12,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-11-19 07:42:12,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:12,631 INFO L225 Difference]: With dead ends: 195 [2022-11-19 07:42:12,631 INFO L226 Difference]: Without dead ends: 171 [2022-11-19 07:42:12,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:42:12,631 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 43 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:12,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 5 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-19 07:42:12,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 117. [2022-11-19 07:42:12,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 2.4521739130434783) internal successors, (282), 116 states have internal predecessors, (282), 0 states have call successors, (0), 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:42:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 282 transitions. [2022-11-19 07:42:12,636 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 282 transitions. Word has length 17 [2022-11-19 07:42:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:12,636 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 282 transitions. [2022-11-19 07:42:12,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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:42:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 282 transitions. [2022-11-19 07:42:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:42:12,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:12,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:12,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-19 07:42:12,637 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:12,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:12,637 INFO L85 PathProgramCache]: Analyzing trace with hash 800027473, now seen corresponding path program 1 times [2022-11-19 07:42:12,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:12,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459210114] [2022-11-19 07:42:12,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:12,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:12,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459210114] [2022-11-19 07:42:12,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459210114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:12,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:12,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:42:12,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911837592] [2022-11-19 07:42:12,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:12,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:42:12,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:12,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:42:12,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:42:12,838 INFO L87 Difference]: Start difference. First operand 117 states and 282 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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:42:12,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:12,972 INFO L93 Difference]: Finished difference Result 116 states and 281 transitions. [2022-11-19 07:42:12,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:42:12,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-19 07:42:12,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:12,973 INFO L225 Difference]: With dead ends: 116 [2022-11-19 07:42:12,974 INFO L226 Difference]: Without dead ends: 116 [2022-11-19 07:42:12,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:42:12,974 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:12,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 10 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-19 07:42:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 105. [2022-11-19 07:42:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 2.5) internal successors, (260), 104 states have internal predecessors, (260), 0 states have call successors, (0), 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:42:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 260 transitions. [2022-11-19 07:42:12,978 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 260 transitions. Word has length 22 [2022-11-19 07:42:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:12,978 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 260 transitions. [2022-11-19 07:42:12,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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:42:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 260 transitions. [2022-11-19 07:42:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:42:12,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:12,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:12,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-19 07:42:12,979 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:12,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:12,979 INFO L85 PathProgramCache]: Analyzing trace with hash -968930225, now seen corresponding path program 1 times [2022-11-19 07:42:12,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:12,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105720607] [2022-11-19 07:42:12,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:12,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:13,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:13,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105720607] [2022-11-19 07:42:13,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105720607] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:42:13,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509928121] [2022-11-19 07:42:13,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:13,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:13,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:42:13,382 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:42:13,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:42:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:13,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:42:13,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:42:13,710 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:42:13,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 32 [2022-11-19 07:42:13,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-11-19 07:42:13,946 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:42:13,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 37 [2022-11-19 07:42:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:14,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:42:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:14,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509928121] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:42:14,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1031197518] [2022-11-19 07:42:14,732 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 07:42:14,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:42:14,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-19 07:42:14,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050427977] [2022-11-19 07:42:14,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:42:14,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-19 07:42:14,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:14,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-19 07:42:14,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-19 07:42:14,743 INFO L87 Difference]: Start difference. First operand 105 states and 260 transitions. Second operand has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 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:42:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:14,928 INFO L93 Difference]: Finished difference Result 165 states and 408 transitions. [2022-11-19 07:42:14,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:42:14,928 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 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 23 [2022-11-19 07:42:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:14,929 INFO L225 Difference]: With dead ends: 165 [2022-11-19 07:42:14,929 INFO L226 Difference]: Without dead ends: 139 [2022-11-19 07:42:14,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-19 07:42:14,930 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 59 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:14,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 35 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 203 Invalid, 0 Unknown, 196 Unchecked, 0.2s Time] [2022-11-19 07:42:14,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-19 07:42:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 97. [2022-11-19 07:42:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 2.5) internal successors, (240), 96 states have internal predecessors, (240), 0 states have call successors, (0), 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:42:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 240 transitions. [2022-11-19 07:42:14,933 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 240 transitions. Word has length 23 [2022-11-19 07:42:14,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:14,934 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 240 transitions. [2022-11-19 07:42:14,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 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:42:14,934 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 240 transitions. [2022-11-19 07:42:14,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 07:42:14,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:14,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:14,947 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-19 07:42:15,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-19 07:42:15,142 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:15,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:15,142 INFO L85 PathProgramCache]: Analyzing trace with hash 930095946, now seen corresponding path program 1 times [2022-11-19 07:42:15,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:15,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260738016] [2022-11-19 07:42:15,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:15,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:15,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:15,484 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:15,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260738016] [2022-11-19 07:42:15,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260738016] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:42:15,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369334003] [2022-11-19 07:42:15,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:15,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:15,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:42:15,486 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:42:15,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 07:42:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:15,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:42:15,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:42:15,753 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:42:15,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 32 [2022-11-19 07:42:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:15,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:42:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:18,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369334003] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:42:18,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [647424163] [2022-11-19 07:42:18,567 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 07:42:18,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:42:18,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2022-11-19 07:42:18,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313332371] [2022-11-19 07:42:18,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:42:18,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-19 07:42:18,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:18,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-19 07:42:18,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:42:18,570 INFO L87 Difference]: Start difference. First operand 97 states and 240 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 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:42:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:18,725 INFO L93 Difference]: Finished difference Result 197 states and 483 transitions. [2022-11-19 07:42:18,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:42:18,726 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 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 24 [2022-11-19 07:42:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:18,727 INFO L225 Difference]: With dead ends: 197 [2022-11-19 07:42:18,727 INFO L226 Difference]: Without dead ends: 133 [2022-11-19 07:42:18,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:42:18,728 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 44 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:18,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 27 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 98 Unchecked, 0.1s Time] [2022-11-19 07:42:18,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-19 07:42:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-11-19 07:42:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.492424242424242) internal successors, (329), 132 states have internal predecessors, (329), 0 states have call successors, (0), 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:42:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 329 transitions. [2022-11-19 07:42:18,732 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 329 transitions. Word has length 24 [2022-11-19 07:42:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:18,732 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 329 transitions. [2022-11-19 07:42:18,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 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:42:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 329 transitions. [2022-11-19 07:42:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 07:42:18,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:18,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:18,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 07:42:18,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:18,933 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:18,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:18,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1541936214, now seen corresponding path program 2 times [2022-11-19 07:42:18,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:18,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275175622] [2022-11-19 07:42:18,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:18,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:19,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:19,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275175622] [2022-11-19 07:42:19,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275175622] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:42:19,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196236237] [2022-11-19 07:42:19,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:42:19,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:19,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:42:19,291 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:42:19,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 07:42:19,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 07:42:19,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:42:19,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:42:19,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:42:19,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:42:19,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:42:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:19,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:42:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:19,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196236237] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:42:19,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [916586171] [2022-11-19 07:42:19,779 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 07:42:19,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:42:19,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 5 [2022-11-19 07:42:19,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153464466] [2022-11-19 07:42:19,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:42:19,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:42:19,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:19,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:42:19,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:42:19,787 INFO L87 Difference]: Start difference. First operand 133 states and 329 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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:42:19,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:19,907 INFO L93 Difference]: Finished difference Result 167 states and 408 transitions. [2022-11-19 07:42:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:42:19,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 24 [2022-11-19 07:42:19,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:19,909 INFO L225 Difference]: With dead ends: 167 [2022-11-19 07:42:19,909 INFO L226 Difference]: Without dead ends: 157 [2022-11-19 07:42:19,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:42:19,909 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:19,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 13 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 44 Unchecked, 0.1s Time] [2022-11-19 07:42:19,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-19 07:42:19,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 131. [2022-11-19 07:42:19,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 2.4846153846153847) internal successors, (323), 130 states have internal predecessors, (323), 0 states have call successors, (0), 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:42:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 323 transitions. [2022-11-19 07:42:19,913 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 323 transitions. Word has length 24 [2022-11-19 07:42:19,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:19,914 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 323 transitions. [2022-11-19 07:42:19,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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:42:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 323 transitions. [2022-11-19 07:42:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 07:42:19,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:19,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:19,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 07:42:20,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-19 07:42:20,117 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:20,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:20,118 INFO L85 PathProgramCache]: Analyzing trace with hash 674568775, now seen corresponding path program 1 times [2022-11-19 07:42:20,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:20,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597950752] [2022-11-19 07:42:20,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:20,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:42:20,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:20,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597950752] [2022-11-19 07:42:20,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597950752] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:42:20,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451847667] [2022-11-19 07:42:20,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:20,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:20,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:42:20,531 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:42:20,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 07:42:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:20,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:42:20,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:42:20,791 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:42:20,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 32 [2022-11-19 07:42:20,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-11-19 07:42:20,954 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:42:20,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 37 [2022-11-19 07:42:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:42:21,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:42:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:42:21,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451847667] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:42:21,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [601623537] [2022-11-19 07:42:21,584 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 07:42:21,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:42:21,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2022-11-19 07:42:21,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451796227] [2022-11-19 07:42:21,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:42:21,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-19 07:42:21,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:21,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-19 07:42:21,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:42:21,588 INFO L87 Difference]: Start difference. First operand 131 states and 323 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 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:42:21,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:21,729 INFO L93 Difference]: Finished difference Result 259 states and 665 transitions. [2022-11-19 07:42:21,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 07:42:21,730 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 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 25 [2022-11-19 07:42:21,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:21,731 INFO L225 Difference]: With dead ends: 259 [2022-11-19 07:42:21,731 INFO L226 Difference]: Without dead ends: 249 [2022-11-19 07:42:21,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:42:21,732 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:21,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 28 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 139 Unchecked, 0.1s Time] [2022-11-19 07:42:21,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-19 07:42:21,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 201. [2022-11-19 07:42:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 2.605) internal successors, (521), 200 states have internal predecessors, (521), 0 states have call successors, (0), 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:42:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 521 transitions. [2022-11-19 07:42:21,738 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 521 transitions. Word has length 25 [2022-11-19 07:42:21,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:21,738 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 521 transitions. [2022-11-19 07:42:21,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 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:42:21,739 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 521 transitions. [2022-11-19 07:42:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 07:42:21,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:21,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:21,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 07:42:21,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-19 07:42:21,940 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:21,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:21,940 INFO L85 PathProgramCache]: Analyzing trace with hash 503734279, now seen corresponding path program 2 times [2022-11-19 07:42:21,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:21,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182848595] [2022-11-19 07:42:21,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:21,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:22,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:22,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182848595] [2022-11-19 07:42:22,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182848595] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:42:22,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746393958] [2022-11-19 07:42:22,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:42:22,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:22,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:42:22,270 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:42:22,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 07:42:22,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-19 07:42:22,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:42:22,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-19 07:42:22,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:42:22,565 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:42:22,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 32 [2022-11-19 07:42:22,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-19 07:42:22,727 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:42:22,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 34 [2022-11-19 07:42:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:22,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:42:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:23,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746393958] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:42:23,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [216347065] [2022-11-19 07:42:23,110 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 07:42:23,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:42:23,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2022-11-19 07:42:23,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939959405] [2022-11-19 07:42:23,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:42:23,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-19 07:42:23,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:23,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-19 07:42:23,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-11-19 07:42:23,113 INFO L87 Difference]: Start difference. First operand 201 states and 521 transitions. Second operand has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 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:42:23,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:23,214 INFO L93 Difference]: Finished difference Result 265 states and 676 transitions. [2022-11-19 07:42:23,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:42:23,215 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 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) Word has length 25 [2022-11-19 07:42:23,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:23,216 INFO L225 Difference]: With dead ends: 265 [2022-11-19 07:42:23,216 INFO L226 Difference]: Without dead ends: 255 [2022-11-19 07:42:23,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-11-19 07:42:23,217 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 36 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:23,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 24 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 170 Unchecked, 0.1s Time] [2022-11-19 07:42:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-19 07:42:23,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 239. [2022-11-19 07:42:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 2.5798319327731094) internal successors, (614), 238 states have internal predecessors, (614), 0 states have call successors, (0), 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:42:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 614 transitions. [2022-11-19 07:42:23,224 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 614 transitions. Word has length 25 [2022-11-19 07:42:23,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:23,224 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 614 transitions. [2022-11-19 07:42:23,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 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:42:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 614 transitions. [2022-11-19 07:42:23,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 07:42:23,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:23,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:23,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 07:42:23,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-19 07:42:23,439 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1987426408, now seen corresponding path program 1 times [2022-11-19 07:42:23,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:23,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818397669] [2022-11-19 07:42:23,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:23,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:23,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:42:23,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:23,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818397669] [2022-11-19 07:42:23,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818397669] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:42:23,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205252742] [2022-11-19 07:42:23,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:23,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:23,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:42:23,812 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:42:23,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 07:42:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:24,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:42:24,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:42:24,092 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:42:24,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 32 [2022-11-19 07:42:24,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-11-19 07:42:24,236 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:42:24,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 37 [2022-11-19 07:42:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:42:24,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:42:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:42:24,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205252742] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:42:24,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [772610415] [2022-11-19 07:42:24,845 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 07:42:24,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:42:24,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2022-11-19 07:42:24,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859059378] [2022-11-19 07:42:24,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:42:24,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-19 07:42:24,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:24,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-19 07:42:24,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:42:24,848 INFO L87 Difference]: Start difference. First operand 239 states and 614 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 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:42:24,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:24,981 INFO L93 Difference]: Finished difference Result 329 states and 840 transitions. [2022-11-19 07:42:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:42:24,982 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 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 25 [2022-11-19 07:42:24,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:24,984 INFO L225 Difference]: With dead ends: 329 [2022-11-19 07:42:24,984 INFO L226 Difference]: Without dead ends: 197 [2022-11-19 07:42:24,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:42:24,985 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 53 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:24,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 27 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 162 Unchecked, 0.1s Time] [2022-11-19 07:42:24,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-19 07:42:24,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 131. [2022-11-19 07:42:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 2.4846153846153847) internal successors, (323), 130 states have internal predecessors, (323), 0 states have call successors, (0), 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:42:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 323 transitions. [2022-11-19 07:42:24,991 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 323 transitions. Word has length 25 [2022-11-19 07:42:24,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:24,992 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 323 transitions. [2022-11-19 07:42:24,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 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:42:24,992 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 323 transitions. [2022-11-19 07:42:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 07:42:24,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:24,994 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:25,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 07:42:25,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-19 07:42:25,201 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:25,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:25,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1598845903, now seen corresponding path program 3 times [2022-11-19 07:42:25,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:25,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867486899] [2022-11-19 07:42:25,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:25,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:42:25,637 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:25,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867486899] [2022-11-19 07:42:25,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867486899] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:42:25,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443860305] [2022-11-19 07:42:25,637 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:42:25,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:25,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:42:25,639 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:42:25,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 07:42:25,895 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:42:25,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:42:25,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-19 07:42:25,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:42:25,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:42:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:42:26,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:42:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 07:42:26,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443860305] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:42:26,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1266230201] [2022-11-19 07:42:26,725 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 07:42:26,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:42:26,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 14 [2022-11-19 07:42:26,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679575160] [2022-11-19 07:42:26,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:42:26,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-19 07:42:26,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:26,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-19 07:42:26,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-11-19 07:42:26,728 INFO L87 Difference]: Start difference. First operand 131 states and 323 transitions. Second operand has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 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:42:26,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:26,891 INFO L93 Difference]: Finished difference Result 366 states and 918 transitions. [2022-11-19 07:42:26,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-19 07:42:26,891 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 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 35 [2022-11-19 07:42:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:26,893 INFO L225 Difference]: With dead ends: 366 [2022-11-19 07:42:26,893 INFO L226 Difference]: Without dead ends: 308 [2022-11-19 07:42:26,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-11-19 07:42:26,893 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 62 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 373 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:26,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 45 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 373 Unchecked, 0.1s Time] [2022-11-19 07:42:26,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-11-19 07:42:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 265. [2022-11-19 07:42:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 2.537878787878788) internal successors, (670), 264 states have internal predecessors, (670), 0 states have call successors, (0), 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:42:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 670 transitions. [2022-11-19 07:42:26,905 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 670 transitions. Word has length 35 [2022-11-19 07:42:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:26,905 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 670 transitions. [2022-11-19 07:42:26,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 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:42:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 670 transitions. [2022-11-19 07:42:26,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 07:42:26,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:26,907 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:26,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 07:42:27,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-19 07:42:27,114 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:27,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:27,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1769680399, now seen corresponding path program 4 times [2022-11-19 07:42:27,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:27,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382199429] [2022-11-19 07:42:27,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:27,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 07:42:27,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:27,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382199429] [2022-11-19 07:42:27,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382199429] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:42:27,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52980754] [2022-11-19 07:42:27,526 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 07:42:27,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:27,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:42:27,527 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:42:27,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 07:42:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:27,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-19 07:42:27,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:42:27,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:42:27,926 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:42:27,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 32 [2022-11-19 07:42:27,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-19 07:42:28,089 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:42:28,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 34 [2022-11-19 07:42:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:29,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:42:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 07:42:29,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52980754] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:42:29,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1094175112] [2022-11-19 07:42:29,953 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 07:42:29,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:42:29,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 14 [2022-11-19 07:42:29,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910530772] [2022-11-19 07:42:29,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:42:29,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-19 07:42:29,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:29,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-19 07:42:29,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=190, Unknown=1, NotChecked=0, Total=240 [2022-11-19 07:42:29,956 INFO L87 Difference]: Start difference. First operand 265 states and 670 transitions. Second operand has 16 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 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:42:30,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:30,089 INFO L93 Difference]: Finished difference Result 398 states and 1012 transitions. [2022-11-19 07:42:30,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:42:30,089 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 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 35 [2022-11-19 07:42:30,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:30,091 INFO L225 Difference]: With dead ends: 398 [2022-11-19 07:42:30,091 INFO L226 Difference]: Without dead ends: 328 [2022-11-19 07:42:30,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=49, Invalid=190, Unknown=1, NotChecked=0, Total=240 [2022-11-19 07:42:30,094 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 35 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:30,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 46 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 174 Unchecked, 0.1s Time] [2022-11-19 07:42:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-11-19 07:42:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 303. [2022-11-19 07:42:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 2.519867549668874) internal successors, (761), 302 states have internal predecessors, (761), 0 states have call successors, (0), 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:42:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 761 transitions. [2022-11-19 07:42:30,105 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 761 transitions. Word has length 35 [2022-11-19 07:42:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:30,105 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 761 transitions. [2022-11-19 07:42:30,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 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:42:30,106 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 761 transitions. [2022-11-19 07:42:30,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 07:42:30,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:30,107 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:30,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 07:42:30,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:30,313 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:30,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:30,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1259936265, now seen corresponding path program 5 times [2022-11-19 07:42:30,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:30,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811119105] [2022-11-19 07:42:30,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:30,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 07:42:30,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:30,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811119105] [2022-11-19 07:42:30,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811119105] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:42:30,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561643768] [2022-11-19 07:42:30,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:42:30,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:30,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:42:30,753 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:42:30,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 07:42:31,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-19 07:42:31,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:42:31,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-19 07:42:31,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:42:31,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:42:31,263 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:42:31,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 32 [2022-11-19 07:42:31,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-11-19 07:42:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:31,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:42:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 07:42:32,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561643768] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:42:32,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1160518014] [2022-11-19 07:42:32,064 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 07:42:32,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:42:32,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2022-11-19 07:42:32,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097356922] [2022-11-19 07:42:32,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:42:32,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-19 07:42:32,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:32,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-19 07:42:32,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:42:32,067 INFO L87 Difference]: Start difference. First operand 303 states and 761 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 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:42:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:32,175 INFO L93 Difference]: Finished difference Result 450 states and 1144 transitions. [2022-11-19 07:42:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 07:42:32,175 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 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 35 [2022-11-19 07:42:32,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:32,177 INFO L225 Difference]: With dead ends: 450 [2022-11-19 07:42:32,177 INFO L226 Difference]: Without dead ends: 434 [2022-11-19 07:42:32,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:42:32,178 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:32,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 33 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 122 Unchecked, 0.1s Time] [2022-11-19 07:42:32,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-11-19 07:42:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 327. [2022-11-19 07:42:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 2.51840490797546) internal successors, (821), 326 states have internal predecessors, (821), 0 states have call successors, (0), 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:42:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 821 transitions. [2022-11-19 07:42:32,199 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 821 transitions. Word has length 35 [2022-11-19 07:42:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:32,199 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 821 transitions. [2022-11-19 07:42:32,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 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:42:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 821 transitions. [2022-11-19 07:42:32,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 07:42:32,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:32,201 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:32,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 07:42:32,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:32,408 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:32,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:32,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1889965921, now seen corresponding path program 6 times [2022-11-19 07:42:32,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:32,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936645738] [2022-11-19 07:42:32,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:32,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:32,842 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-19 07:42:32,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:32,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936645738] [2022-11-19 07:42:32,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936645738] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:42:32,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381506834] [2022-11-19 07:42:32,843 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:42:32,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:32,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:42:32,847 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:42:32,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 07:42:33,137 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:42:33,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:42:33,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-19 07:42:33,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:42:33,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:42:33,259 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:42:33,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 32 [2022-11-19 07:42:33,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-19 07:42:33,409 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:42:33,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2022-11-19 07:42:33,443 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:33,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:42:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-19 07:42:34,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381506834] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:42:34,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1255920054] [2022-11-19 07:42:34,120 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 07:42:34,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:42:34,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2022-11-19 07:42:34,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022514275] [2022-11-19 07:42:34,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:42:34,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-19 07:42:34,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:34,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-19 07:42:34,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:42:34,123 INFO L87 Difference]: Start difference. First operand 327 states and 821 transitions. Second operand has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 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:42:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:34,265 INFO L93 Difference]: Finished difference Result 466 states and 1151 transitions. [2022-11-19 07:42:34,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:42:34,266 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 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 35 [2022-11-19 07:42:34,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:34,267 INFO L225 Difference]: With dead ends: 466 [2022-11-19 07:42:34,268 INFO L226 Difference]: Without dead ends: 441 [2022-11-19 07:42:34,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:42:34,268 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:34,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 31 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 105 Unchecked, 0.1s Time] [2022-11-19 07:42:34,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-11-19 07:42:34,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 315. [2022-11-19 07:42:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 2.538216560509554) internal successors, (797), 314 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:42:34,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 797 transitions. [2022-11-19 07:42:34,279 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 797 transitions. Word has length 35 [2022-11-19 07:42:34,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:34,279 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 797 transitions. [2022-11-19 07:42:34,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 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:42:34,280 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 797 transitions. [2022-11-19 07:42:34,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 07:42:34,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:34,281 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:34,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-19 07:42:34,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:34,487 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-19 07:42:34,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:34,488 INFO L85 PathProgramCache]: Analyzing trace with hash 966634615, now seen corresponding path program 7 times [2022-11-19 07:42:34,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:34,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46385623] [2022-11-19 07:42:34,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:34,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:42:34,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:34,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46385623] [2022-11-19 07:42:34,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46385623] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:42:34,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919417302] [2022-11-19 07:42:34,900 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 07:42:34,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:34,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:42:34,903 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:42:34,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-19 07:42:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:35,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-19 07:42:35,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:42:35,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 07:42:35,317 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:42:35,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 32 [2022-11-19 07:42:35,500 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:42:35,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:42:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:42:36,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919417302] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:42:36,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [342995143] [2022-11-19 07:42:36,246 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 07:42:36,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:42:36,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2022-11-19 07:42:36,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713692597] [2022-11-19 07:42:36,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:42:36,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-19 07:42:36,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:36,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-19 07:42:36,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:42:36,250 INFO L87 Difference]: Start difference. First operand 315 states and 797 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:36,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:36,399 INFO L93 Difference]: Finished difference Result 372 states and 963 transitions. [2022-11-19 07:42:36,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:42:36,400 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-19 07:42:36,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:36,400 INFO L225 Difference]: With dead ends: 372 [2022-11-19 07:42:36,400 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 07:42:36,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:42:36,401 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:36,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 42 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 166 Unchecked, 0.1s Time] [2022-11-19 07:42:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 07:42:36,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 07:42:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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:42:36,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 07:42:36,403 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-11-19 07:42:36,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:36,403 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 07:42:36,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:42:36,403 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 07:42:36,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 07:42:36,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK (30 of 31 remaining) [2022-11-19 07:42:36,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (29 of 31 remaining) [2022-11-19 07:42:36,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2022-11-19 07:42:36,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2022-11-19 07:42:36,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (26 of 31 remaining) [2022-11-19 07:42:36,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (25 of 31 remaining) [2022-11-19 07:42:36,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2022-11-19 07:42:36,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2022-11-19 07:42:36,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2022-11-19 07:42:36,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2022-11-19 07:42:36,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (20 of 31 remaining) [2022-11-19 07:42:36,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 31 remaining) [2022-11-19 07:42:36,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr7ASSERT_VIOLATIONMEMORY_LEAK (18 of 31 remaining) [2022-11-19 07:42:36,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2022-11-19 07:42:36,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2022-11-19 07:42:36,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2022-11-19 07:42:36,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2022-11-19 07:42:36,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2022-11-19 07:42:36,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2022-11-19 07:42:36,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr6ASSERT_VIOLATIONMEMORY_LEAK (11 of 31 remaining) [2022-11-19 07:42:36,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 31 remaining) [2022-11-19 07:42:36,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 31 remaining) [2022-11-19 07:42:36,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr7ASSERT_VIOLATIONMEMORY_LEAK (8 of 31 remaining) [2022-11-19 07:42:36,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2022-11-19 07:42:36,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2022-11-19 07:42:36,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2022-11-19 07:42:36,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2022-11-19 07:42:36,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2022-11-19 07:42:36,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2022-11-19 07:42:36,411 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr6ASSERT_VIOLATIONMEMORY_LEAK (1 of 31 remaining) [2022-11-19 07:42:36,411 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbThread1of1ForFork0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 31 remaining) [2022-11-19 07:42:36,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-19 07:42:36,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-19 07:42:36,619 INFO L444 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:36,624 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:42:36,624 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:42:36,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:42:36 BasicIcfg [2022-11-19 07:42:36,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:42:36,627 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:42:36,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:42:36,628 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:42:36,628 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:51" (3/4) ... [2022-11-19 07:42:36,631 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 07:42:36,637 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread_ath9k [2022-11-19 07:42:36,638 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread_usb [2022-11-19 07:42:36,642 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-19 07:42:36,642 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-19 07:42:36,643 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-19 07:42:36,643 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 07:42:36,681 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:42:36,683 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:42:36,685 INFO L158 Benchmark]: Toolchain (without parser) took 46813.35ms. Allocated memory was 140.5MB in the beginning and 432.0MB in the end (delta: 291.5MB). Free memory was 105.1MB in the beginning and 197.4MB in the end (delta: -92.2MB). Peak memory consumption was 198.9MB. Max. memory is 16.1GB. [2022-11-19 07:42:36,690 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory was 57.3MB in the beginning and 57.3MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:42:36,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1014.27ms. Allocated memory is still 140.5MB. Free memory was 105.1MB in the beginning and 72.5MB in the end (delta: 32.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-19 07:42:36,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.10ms. Allocated memory is still 140.5MB. Free memory was 72.5MB in the beginning and 113.1MB in the end (delta: -40.6MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-11-19 07:42:36,693 INFO L158 Benchmark]: Boogie Preprocessor took 43.93ms. Allocated memory is still 140.5MB. Free memory was 113.1MB in the beginning and 110.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:42:36,693 INFO L158 Benchmark]: RCFGBuilder took 934.73ms. Allocated memory is still 140.5MB. Free memory was 110.6MB in the beginning and 83.9MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-19 07:42:36,693 INFO L158 Benchmark]: TraceAbstraction took 44673.53ms. Allocated memory was 140.5MB in the beginning and 432.0MB in the end (delta: 291.5MB). Free memory was 83.4MB in the beginning and 200.5MB in the end (delta: -117.1MB). Peak memory consumption was 174.4MB. Max. memory is 16.1GB. [2022-11-19 07:42:36,693 INFO L158 Benchmark]: Witness Printer took 55.50ms. Allocated memory is still 432.0MB. Free memory was 200.5MB in the beginning and 197.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:42:36,694 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory was 57.3MB in the beginning and 57.3MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1014.27ms. Allocated memory is still 140.5MB. Free memory was 105.1MB in the beginning and 72.5MB in the end (delta: 32.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.10ms. Allocated memory is still 140.5MB. Free memory was 72.5MB in the beginning and 113.1MB in the end (delta: -40.6MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.93ms. Allocated memory is still 140.5MB. Free memory was 113.1MB in the beginning and 110.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 934.73ms. Allocated memory is still 140.5MB. Free memory was 110.6MB in the beginning and 83.9MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 44673.53ms. Allocated memory was 140.5MB in the beginning and 432.0MB in the end (delta: 291.5MB). Free memory was 83.4MB in the beginning and 200.5MB in the end (delta: -117.1MB). Peak memory consumption was 174.4MB. Max. memory is 16.1GB. * Witness Printer took 55.50ms. Allocated memory is still 432.0MB. Free memory was 200.5MB in the beginning and 197.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.4s, 323 PlacesBefore, 69 PlacesAfterwards, 353 TransitionsBefore, 78 TransitionsAfterwards, 12794 CoEnabledTransitionPairs, 7 FixpointIterations, 188 TrivialSequentialCompositions, 166 ConcurrentSequentialCompositions, 30 TrivialYvCompositions, 44 ConcurrentYvCompositions, 21 ChoiceCompositions, 449 TotalNumberOfCompositions, 18289 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13899, independent: 13714, independent conditional: 0, independent unconditional: 13714, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9233, independent: 9161, independent conditional: 0, independent unconditional: 9161, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9233, independent: 9122, independent conditional: 0, independent unconditional: 9122, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 111, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 325, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 257, dependent conditional: 0, dependent unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13899, independent: 4553, independent conditional: 0, independent unconditional: 4553, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 9233, unknown conditional: 0, unknown unconditional: 9233] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 281, Positive conditional cache size: 0, Positive unconditional cache size: 281, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1693]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1693]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1693]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1795]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1693]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1693]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1693]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 350 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 44.5s, OverallIterations: 33, TraceHistogramMax: 2, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1133 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1133 mSDsluCounter, 705 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1749 IncrementalHoareTripleChecker+Unchecked, 427 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3266 IncrementalHoareTripleChecker+Invalid, 5107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 278 mSDtfsCounter, 3266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 740 GetRequests, 554 SyntacticMatches, 37 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1254occurred in iteration=4, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 2169 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 842 NumberOfCodeBlocks, 842 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1108 ConstructedInterpolants, 283 QuantifiedInterpolants, 17128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4046 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 55 InterpolantComputations, 22 PerfectInterpolantSequences, 176/417 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-19 07:42:36,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bf1f064-36c2-475a-badc-a00f2248426e/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE