./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 --- 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-2329fc7 [2022-12-14 04:55:01,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 04:55:01,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 04:55:01,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 04:55:01,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 04:55:01,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 04:55:01,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 04:55:01,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 04:55:01,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 04:55:01,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 04:55:01,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 04:55:01,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 04:55:01,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 04:55:01,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 04:55:01,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 04:55:01,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 04:55:01,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 04:55:01,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 04:55:01,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 04:55:01,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 04:55:01,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 04:55:01,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 04:55:01,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 04:55:01,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 04:55:01,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 04:55:01,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 04:55:01,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 04:55:01,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 04:55:01,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 04:55:01,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 04:55:01,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 04:55:01,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 04:55:01,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 04:55:01,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 04:55:01,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 04:55:01,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 04:55:01,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 04:55:01,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 04:55:01,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 04:55:01,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 04:55:01,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 04:55:01,244 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-12-14 04:55:01,264 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 04:55:01,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 04:55:01,264 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 04:55:01,265 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 04:55:01,265 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 04:55:01,265 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 04:55:01,266 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 04:55:01,266 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 04:55:01,266 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 04:55:01,266 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 04:55:01,266 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 04:55:01,266 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 04:55:01,267 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 04:55:01,267 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 04:55:01,267 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 04:55:01,267 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 04:55:01,267 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 04:55:01,267 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 04:55:01,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 04:55:01,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 04:55:01,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 04:55:01,268 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 04:55:01,269 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 04:55:01,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 04:55:01,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 04:55:01,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 04:55:01,269 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 04:55:01,269 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 04:55:01,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 04:55:01,270 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 04:55:01,270 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 04:55:01,270 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 04:55:01,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 04:55:01,270 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 04:55:01,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:55:01,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 04:55:01,271 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 04:55:01,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 04:55:01,271 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 04:55:01,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 04:55:01,272 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 04:55:01,272 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_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/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_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh 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-memcleanup) ) 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 -> 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 [2022-12-14 04:55:01,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 04:55:01,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 04:55:01,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 04:55:01,481 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 04:55:01,482 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 04:55:01,483 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2022-12-14 04:55:04,169 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 04:55:04,379 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 04:55:04,379 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2022-12-14 04:55:04,388 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/data/9d08cafd4/d5f9c0f6b0ae4d7bbd7caf7a8931b651/FLAGf7aacf611 [2022-12-14 04:55:04,398 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/data/9d08cafd4/d5f9c0f6b0ae4d7bbd7caf7a8931b651 [2022-12-14 04:55:04,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 04:55:04,401 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 04:55:04,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 04:55:04,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 04:55:04,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 04:55:04,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:55:04" (1/1) ... [2022-12-14 04:55:04,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1eae74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:55:04, skipping insertion in model container [2022-12-14 04:55:04,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:55:04" (1/1) ... [2022-12-14 04:55:04,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 04:55:04,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 04:55:04,689 WARN L237 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_41369cc0-8987-49b5-b64b-fbcea13bfd20/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2022-12-14 04:55:04,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:55:04,740 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 04:55:04,765 WARN L237 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_41369cc0-8987-49b5-b64b-fbcea13bfd20/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2022-12-14 04:55:04,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:55:04,809 INFO L208 MainTranslator]: Completed translation [2022-12-14 04:55:04,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:55:04 WrapperNode [2022-12-14 04:55:04,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 04:55:04,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 04:55:04,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 04:55:04,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 04:55:04,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:55:04" (1/1) ... [2022-12-14 04:55:04,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:55:04" (1/1) ... [2022-12-14 04:55:04,858 INFO L138 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 234 [2022-12-14 04:55:04,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 04:55:04,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 04:55:04,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 04:55:04,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 04:55:04,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:55:04" (1/1) ... [2022-12-14 04:55:04,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:55:04" (1/1) ... [2022-12-14 04:55:04,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:55:04" (1/1) ... [2022-12-14 04:55:04,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:55:04" (1/1) ... [2022-12-14 04:55:04,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:55:04" (1/1) ... [2022-12-14 04:55:04,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:55:04" (1/1) ... [2022-12-14 04:55:04,894 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:55:04" (1/1) ... [2022-12-14 04:55:04,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:55:04" (1/1) ... [2022-12-14 04:55:04,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 04:55:04,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 04:55:04,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 04:55:04,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 04:55:04,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:55:04" (1/1) ... [2022-12-14 04:55:04,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:55:04,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:55:04,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 04:55:04,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 04:55:04,956 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-12-14 04:55:04,957 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-12-14 04:55:04,957 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2022-12-14 04:55:04,957 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2022-12-14 04:55:04,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 04:55:04,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 04:55:04,957 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2022-12-14 04:55:04,957 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2022-12-14 04:55:04,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 04:55:04,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 04:55:04,957 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-12-14 04:55:04,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-12-14 04:55:04,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 04:55:04,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 04:55:04,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 04:55:04,958 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2022-12-14 04:55:04,958 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2022-12-14 04:55:04,958 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2022-12-14 04:55:04,958 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2022-12-14 04:55:04,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 04:55:04,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 04:55:04,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 04:55:05,062 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 04:55:05,064 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 04:55:05,527 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 04:55:05,623 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 04:55:05,623 INFO L300 CfgBuilder]: Removed 38 assume(true) statements. [2022-12-14 04:55:05,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:55:05 BoogieIcfgContainer [2022-12-14 04:55:05,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 04:55:05,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 04:55:05,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 04:55:05,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 04:55:05,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:55:04" (1/3) ... [2022-12-14 04:55:05,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5986b47e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:55:05, skipping insertion in model container [2022-12-14 04:55:05,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:55:04" (2/3) ... [2022-12-14 04:55:05,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5986b47e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:55:05, skipping insertion in model container [2022-12-14 04:55:05,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:55:05" (3/3) ... [2022-12-14 04:55:05,631 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2022-12-14 04:55:05,645 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 04:55:05,645 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2022-12-14 04:55:05,682 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 04:55:05,687 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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;@e1d2449, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 04:55:05,687 INFO L358 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2022-12-14 04:55:05,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 103 states have (on average 2.495145631067961) internal successors, (257), 220 states have internal predecessors, (257), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-12-14 04:55:05,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 04:55:05,696 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:05,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:05,697 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:05,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:05,700 INFO L85 PathProgramCache]: Analyzing trace with hash -195677477, now seen corresponding path program 1 times [2022-12-14 04:55:05,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:05,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683731136] [2022-12-14 04:55:05,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:05,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:55:05,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:05,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683731136] [2022-12-14 04:55:05,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683731136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:55:05,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:55:05,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:55:05,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183898383] [2022-12-14 04:55:05,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:55:05,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:55:05,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:05,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:55:05,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:55:05,913 INFO L87 Difference]: Start difference. First operand has 232 states, 103 states have (on average 2.495145631067961) internal successors, (257), 220 states have internal predecessors, (257), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:06,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:06,093 INFO L93 Difference]: Finished difference Result 231 states and 263 transitions. [2022-12-14 04:55:06,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:55:06,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 04:55:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:06,103 INFO L225 Difference]: With dead ends: 231 [2022-12-14 04:55:06,103 INFO L226 Difference]: Without dead ends: 230 [2022-12-14 04:55:06,104 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-12-14 04:55:06,107 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 19 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:06,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 355 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:55:06,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-12-14 04:55:06,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2022-12-14 04:55:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 103 states have (on average 2.174757281553398) internal successors, (224), 216 states have internal predecessors, (224), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 04:55:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 258 transitions. [2022-12-14 04:55:06,145 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 258 transitions. Word has length 7 [2022-12-14 04:55:06,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:06,146 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 258 transitions. [2022-12-14 04:55:06,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:06,146 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 258 transitions. [2022-12-14 04:55:06,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 04:55:06,146 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:06,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:06,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 04:55:06,147 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:06,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:06,147 INFO L85 PathProgramCache]: Analyzing trace with hash -195677476, now seen corresponding path program 1 times [2022-12-14 04:55:06,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:06,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167600301] [2022-12-14 04:55:06,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:06,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:55:06,234 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:06,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167600301] [2022-12-14 04:55:06,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167600301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:55:06,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:55:06,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:55:06,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203990027] [2022-12-14 04:55:06,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:55:06,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:55:06,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:06,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:55:06,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:55:06,237 INFO L87 Difference]: Start difference. First operand 228 states and 258 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:06,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:06,385 INFO L93 Difference]: Finished difference Result 228 states and 260 transitions. [2022-12-14 04:55:06,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:55:06,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 04:55:06,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:06,387 INFO L225 Difference]: With dead ends: 228 [2022-12-14 04:55:06,387 INFO L226 Difference]: Without dead ends: 228 [2022-12-14 04:55:06,387 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-12-14 04:55:06,388 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 17 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:06,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 360 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:55:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-12-14 04:55:06,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2022-12-14 04:55:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 103 states have (on average 2.1553398058252426) internal successors, (222), 214 states have internal predecessors, (222), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 04:55:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 256 transitions. [2022-12-14 04:55:06,397 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 256 transitions. Word has length 7 [2022-12-14 04:55:06,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:06,397 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 256 transitions. [2022-12-14 04:55:06,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 256 transitions. [2022-12-14 04:55:06,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 04:55:06,398 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:06,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:06,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 04:55:06,398 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:06,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:06,399 INFO L85 PathProgramCache]: Analyzing trace with hash 915293198, now seen corresponding path program 1 times [2022-12-14 04:55:06,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:06,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992285470] [2022-12-14 04:55:06,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:06,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:55:06,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:06,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992285470] [2022-12-14 04:55:06,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992285470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:55:06,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:55:06,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:55:06,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061268142] [2022-12-14 04:55:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:55:06,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:55:06,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:06,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:55:06,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:55:06,442 INFO L87 Difference]: Start difference. First operand 226 states and 256 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:06,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:06,544 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2022-12-14 04:55:06,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:55:06,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 04:55:06,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:06,545 INFO L225 Difference]: With dead ends: 223 [2022-12-14 04:55:06,546 INFO L226 Difference]: Without dead ends: 223 [2022-12-14 04:55:06,546 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-12-14 04:55:06,547 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 17 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:06,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 346 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:55:06,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-12-14 04:55:06,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2022-12-14 04:55:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 103 states have (on average 2.1262135922330097) internal successors, (219), 211 states have internal predecessors, (219), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 04:55:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2022-12-14 04:55:06,560 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 9 [2022-12-14 04:55:06,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:06,560 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2022-12-14 04:55:06,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:06,560 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2022-12-14 04:55:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 04:55:06,561 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:06,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:06,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 04:55:06,561 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:06,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:06,562 INFO L85 PathProgramCache]: Analyzing trace with hash 915293199, now seen corresponding path program 1 times [2022-12-14 04:55:06,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:06,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439849579] [2022-12-14 04:55:06,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:06,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:55:06,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:06,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439849579] [2022-12-14 04:55:06,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439849579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:55:06,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:55:06,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:55:06,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170174883] [2022-12-14 04:55:06,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:55:06,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:55:06,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:06,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:55:06,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:55:06,646 INFO L87 Difference]: Start difference. First operand 223 states and 253 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:06,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:06,774 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2022-12-14 04:55:06,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:55:06,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 04:55:06,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:06,776 INFO L225 Difference]: With dead ends: 220 [2022-12-14 04:55:06,776 INFO L226 Difference]: Without dead ends: 220 [2022-12-14 04:55:06,776 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-12-14 04:55:06,777 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 14 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:06,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 351 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:55:06,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-12-14 04:55:06,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-12-14 04:55:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 103 states have (on average 2.0970873786407767) internal successors, (216), 208 states have internal predecessors, (216), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 04:55:06,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 250 transitions. [2022-12-14 04:55:06,783 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 250 transitions. Word has length 9 [2022-12-14 04:55:06,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:06,784 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 250 transitions. [2022-12-14 04:55:06,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:06,784 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 250 transitions. [2022-12-14 04:55:06,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 04:55:06,784 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:06,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:06,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 04:55:06,785 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~$Pointer$~TO~VOIDErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:06,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:06,785 INFO L85 PathProgramCache]: Analyzing trace with hash 932524912, now seen corresponding path program 1 times [2022-12-14 04:55:06,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:06,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629487844] [2022-12-14 04:55:06,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:06,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:55:06,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:06,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629487844] [2022-12-14 04:55:06,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629487844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:55:06,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:55:06,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 04:55:06,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81399924] [2022-12-14 04:55:06,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:55:06,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 04:55:06,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:06,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 04:55:06,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:55:06,889 INFO L87 Difference]: Start difference. First operand 220 states and 250 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:07,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:07,046 INFO L93 Difference]: Finished difference Result 242 states and 280 transitions. [2022-12-14 04:55:07,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 04:55:07,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 04:55:07,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:07,048 INFO L225 Difference]: With dead ends: 242 [2022-12-14 04:55:07,048 INFO L226 Difference]: Without dead ends: 242 [2022-12-14 04:55:07,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:55:07,050 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 15 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:07,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 867 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:55:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-12-14 04:55:07,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236. [2022-12-14 04:55:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 112 states have (on average 2.044642857142857) internal successors, (229), 217 states have internal predecessors, (229), 29 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2022-12-14 04:55:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 276 transitions. [2022-12-14 04:55:07,062 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 276 transitions. Word has length 9 [2022-12-14 04:55:07,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:07,062 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 276 transitions. [2022-12-14 04:55:07,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 276 transitions. [2022-12-14 04:55:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 04:55:07,063 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:07,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:07,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 04:55:07,063 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting dll_insert_masterErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:07,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:07,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1247697935, now seen corresponding path program 1 times [2022-12-14 04:55:07,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:07,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970136826] [2022-12-14 04:55:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:07,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:55:07,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:07,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970136826] [2022-12-14 04:55:07,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970136826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:55:07,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:55:07,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 04:55:07,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704045977] [2022-12-14 04:55:07,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:55:07,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 04:55:07,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:07,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 04:55:07,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 04:55:07,233 INFO L87 Difference]: Start difference. First operand 236 states and 276 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:07,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:07,524 INFO L93 Difference]: Finished difference Result 255 states and 298 transitions. [2022-12-14 04:55:07,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 04:55:07,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 04:55:07,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:07,526 INFO L225 Difference]: With dead ends: 255 [2022-12-14 04:55:07,526 INFO L226 Difference]: Without dead ends: 255 [2022-12-14 04:55:07,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-14 04:55:07,527 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 89 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:07,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 866 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 04:55:07,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-12-14 04:55:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 245. [2022-12-14 04:55:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 120 states have (on average 1.9916666666666667) internal successors, (239), 224 states have internal predecessors, (239), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-12-14 04:55:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 288 transitions. [2022-12-14 04:55:07,541 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 288 transitions. Word has length 12 [2022-12-14 04:55:07,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:07,541 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 288 transitions. [2022-12-14 04:55:07,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 288 transitions. [2022-12-14 04:55:07,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 04:55:07,542 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:07,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:07,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 04:55:07,542 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting dll_insert_masterErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:07,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:07,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1247697934, now seen corresponding path program 1 times [2022-12-14 04:55:07,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:07,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706534765] [2022-12-14 04:55:07,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:07,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:07,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:55:07,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:07,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706534765] [2022-12-14 04:55:07,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706534765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:55:07,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:55:07,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 04:55:07,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519930071] [2022-12-14 04:55:07,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:55:07,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 04:55:07,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:07,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 04:55:07,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 04:55:07,770 INFO L87 Difference]: Start difference. First operand 245 states and 288 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:08,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:08,160 INFO L93 Difference]: Finished difference Result 253 states and 296 transitions. [2022-12-14 04:55:08,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 04:55:08,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 04:55:08,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:08,162 INFO L225 Difference]: With dead ends: 253 [2022-12-14 04:55:08,162 INFO L226 Difference]: Without dead ends: 253 [2022-12-14 04:55:08,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-14 04:55:08,163 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 60 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:08,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 732 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 04:55:08,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-12-14 04:55:08,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 245. [2022-12-14 04:55:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 120 states have (on average 1.975) internal successors, (237), 224 states have internal predecessors, (237), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-12-14 04:55:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 286 transitions. [2022-12-14 04:55:08,172 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 286 transitions. Word has length 12 [2022-12-14 04:55:08,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:08,172 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 286 transitions. [2022-12-14 04:55:08,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 286 transitions. [2022-12-14 04:55:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 04:55:08,173 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:08,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:08,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 04:55:08,174 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting dll_insert_masterErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:08,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:08,174 INFO L85 PathProgramCache]: Analyzing trace with hash -23910485, now seen corresponding path program 1 times [2022-12-14 04:55:08,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:08,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323299354] [2022-12-14 04:55:08,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:08,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:08,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:55:08,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:08,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323299354] [2022-12-14 04:55:08,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323299354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:55:08,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:55:08,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:55:08,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319980285] [2022-12-14 04:55:08,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:55:08,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:55:08,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:08,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:55:08,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:55:08,225 INFO L87 Difference]: Start difference. First operand 245 states and 286 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:08,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:08,368 INFO L93 Difference]: Finished difference Result 244 states and 285 transitions. [2022-12-14 04:55:08,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 04:55:08,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 04:55:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:08,369 INFO L225 Difference]: With dead ends: 244 [2022-12-14 04:55:08,370 INFO L226 Difference]: Without dead ends: 244 [2022-12-14 04:55:08,370 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-12-14 04:55:08,370 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 23 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:08,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 478 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:55:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-12-14 04:55:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-12-14 04:55:08,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 120 states have (on average 1.9666666666666666) internal successors, (236), 223 states have internal predecessors, (236), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-12-14 04:55:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 285 transitions. [2022-12-14 04:55:08,378 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 285 transitions. Word has length 13 [2022-12-14 04:55:08,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:08,379 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 285 transitions. [2022-12-14 04:55:08,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 285 transitions. [2022-12-14 04:55:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 04:55:08,379 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:08,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:08,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 04:55:08,380 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting dll_insert_masterErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:08,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:08,380 INFO L85 PathProgramCache]: Analyzing trace with hash -23910484, now seen corresponding path program 1 times [2022-12-14 04:55:08,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:08,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478109547] [2022-12-14 04:55:08,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:08,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:55:08,456 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:08,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478109547] [2022-12-14 04:55:08,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478109547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:55:08,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:55:08,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:55:08,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200636081] [2022-12-14 04:55:08,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:55:08,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:55:08,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:08,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:55:08,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:55:08,458 INFO L87 Difference]: Start difference. First operand 244 states and 285 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:08,576 INFO L93 Difference]: Finished difference Result 243 states and 284 transitions. [2022-12-14 04:55:08,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:55:08,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 04:55:08,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:08,578 INFO L225 Difference]: With dead ends: 243 [2022-12-14 04:55:08,578 INFO L226 Difference]: Without dead ends: 243 [2022-12-14 04:55:08,578 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-12-14 04:55:08,579 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 24 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:08,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 547 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:55:08,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-12-14 04:55:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2022-12-14 04:55:08,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 120 states have (on average 1.9583333333333333) internal successors, (235), 222 states have internal predecessors, (235), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-12-14 04:55:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 284 transitions. [2022-12-14 04:55:08,587 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 284 transitions. Word has length 13 [2022-12-14 04:55:08,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:08,588 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 284 transitions. [2022-12-14 04:55:08,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:08,588 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 284 transitions. [2022-12-14 04:55:08,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 04:55:08,588 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:08,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:08,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 04:55:08,589 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:08,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:08,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1503139572, now seen corresponding path program 1 times [2022-12-14 04:55:08,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:08,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207599883] [2022-12-14 04:55:08,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:08,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:55:08,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:08,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207599883] [2022-12-14 04:55:08,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207599883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:55:08,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:55:08,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 04:55:08,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676974430] [2022-12-14 04:55:08,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:55:08,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 04:55:08,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:08,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 04:55:08,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-14 04:55:08,870 INFO L87 Difference]: Start difference. First operand 243 states and 284 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:09,259 INFO L93 Difference]: Finished difference Result 270 states and 316 transitions. [2022-12-14 04:55:09,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 04:55:09,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 04:55:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:09,261 INFO L225 Difference]: With dead ends: 270 [2022-12-14 04:55:09,261 INFO L226 Difference]: Without dead ends: 270 [2022-12-14 04:55:09,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-14 04:55:09,262 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 23 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:09,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1326 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 04:55:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-12-14 04:55:09,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 257. [2022-12-14 04:55:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 131 states have (on average 1.916030534351145) internal successors, (251), 233 states have internal predecessors, (251), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-12-14 04:55:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2022-12-14 04:55:09,270 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 15 [2022-12-14 04:55:09,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:09,271 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2022-12-14 04:55:09,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2022-12-14 04:55:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 04:55:09,271 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:09,272 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:09,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 04:55:09,272 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~VOIDErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:09,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:09,272 INFO L85 PathProgramCache]: Analyzing trace with hash 818836412, now seen corresponding path program 1 times [2022-12-14 04:55:09,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:09,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805095186] [2022-12-14 04:55:09,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:09,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 04:55:09,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:09,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805095186] [2022-12-14 04:55:09,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805095186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:55:09,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:55:09,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 04:55:09,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893158855] [2022-12-14 04:55:09,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:55:09,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 04:55:09,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:09,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 04:55:09,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:55:09,520 INFO L87 Difference]: Start difference. First operand 257 states and 306 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:09,835 INFO L93 Difference]: Finished difference Result 255 states and 304 transitions. [2022-12-14 04:55:09,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 04:55:09,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 04:55:09,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:09,837 INFO L225 Difference]: With dead ends: 255 [2022-12-14 04:55:09,837 INFO L226 Difference]: Without dead ends: 255 [2022-12-14 04:55:09,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 04:55:09,838 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 49 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:09,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 637 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 04:55:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-12-14 04:55:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-12-14 04:55:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 131 states have (on average 1.900763358778626) internal successors, (249), 231 states have internal predecessors, (249), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-12-14 04:55:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 304 transitions. [2022-12-14 04:55:09,847 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 304 transitions. Word has length 23 [2022-12-14 04:55:09,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:09,847 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 304 transitions. [2022-12-14 04:55:09,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 304 transitions. [2022-12-14 04:55:09,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 04:55:09,848 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:09,848 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:09,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 04:55:09,849 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~VOIDErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:09,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:09,849 INFO L85 PathProgramCache]: Analyzing trace with hash 818836411, now seen corresponding path program 1 times [2022-12-14 04:55:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:09,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556770399] [2022-12-14 04:55:09,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:09,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 04:55:09,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:09,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556770399] [2022-12-14 04:55:09,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556770399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:55:09,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:55:09,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 04:55:09,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749616593] [2022-12-14 04:55:09,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:55:09,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 04:55:09,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:09,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 04:55:09,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 04:55:09,993 INFO L87 Difference]: Start difference. First operand 255 states and 304 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:10,245 INFO L93 Difference]: Finished difference Result 253 states and 302 transitions. [2022-12-14 04:55:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 04:55:10,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 04:55:10,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:10,247 INFO L225 Difference]: With dead ends: 253 [2022-12-14 04:55:10,247 INFO L226 Difference]: Without dead ends: 253 [2022-12-14 04:55:10,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 04:55:10,248 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 43 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:10,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 874 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:55:10,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-12-14 04:55:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2022-12-14 04:55:10,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 131 states have (on average 1.8854961832061068) internal successors, (247), 229 states have internal predecessors, (247), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-12-14 04:55:10,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 302 transitions. [2022-12-14 04:55:10,253 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 302 transitions. Word has length 23 [2022-12-14 04:55:10,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:10,253 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 302 transitions. [2022-12-14 04:55:10,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:10,254 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 302 transitions. [2022-12-14 04:55:10,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 04:55:10,254 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:10,254 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:10,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 04:55:10,255 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~VOIDErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:10,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:10,255 INFO L85 PathProgramCache]: Analyzing trace with hash -385857421, now seen corresponding path program 1 times [2022-12-14 04:55:10,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:10,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896443835] [2022-12-14 04:55:10,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:10,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 04:55:10,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:10,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896443835] [2022-12-14 04:55:10,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896443835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:55:10,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:55:10,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:55:10,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103365626] [2022-12-14 04:55:10,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:55:10,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:55:10,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:10,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:55:10,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:55:10,312 INFO L87 Difference]: Start difference. First operand 253 states and 302 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:10,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:10,423 INFO L93 Difference]: Finished difference Result 252 states and 301 transitions. [2022-12-14 04:55:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:55:10,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 04:55:10,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:10,424 INFO L225 Difference]: With dead ends: 252 [2022-12-14 04:55:10,424 INFO L226 Difference]: Without dead ends: 252 [2022-12-14 04:55:10,424 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-12-14 04:55:10,425 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 20 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:10,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 476 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:55:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-12-14 04:55:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2022-12-14 04:55:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 131 states have (on average 1.8778625954198473) internal successors, (246), 228 states have internal predecessors, (246), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-12-14 04:55:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 301 transitions. [2022-12-14 04:55:10,433 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 301 transitions. Word has length 24 [2022-12-14 04:55:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:10,433 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 301 transitions. [2022-12-14 04:55:10,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 301 transitions. [2022-12-14 04:55:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 04:55:10,434 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:10,434 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:10,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 04:55:10,434 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~VOIDErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:10,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:10,435 INFO L85 PathProgramCache]: Analyzing trace with hash -385857420, now seen corresponding path program 1 times [2022-12-14 04:55:10,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:10,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898598948] [2022-12-14 04:55:10,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:10,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 04:55:10,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:10,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898598948] [2022-12-14 04:55:10,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898598948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:55:10,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:55:10,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:55:10,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106145171] [2022-12-14 04:55:10,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:55:10,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 04:55:10,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:10,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 04:55:10,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:55:10,552 INFO L87 Difference]: Start difference. First operand 252 states and 301 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:10,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:10,714 INFO L93 Difference]: Finished difference Result 251 states and 300 transitions. [2022-12-14 04:55:10,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:55:10,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 04:55:10,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:10,716 INFO L225 Difference]: With dead ends: 251 [2022-12-14 04:55:10,716 INFO L226 Difference]: Without dead ends: 251 [2022-12-14 04:55:10,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:55:10,716 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 18 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:10,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 687 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:55:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-12-14 04:55:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-12-14 04:55:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 131 states have (on average 1.8702290076335877) internal successors, (245), 227 states have internal predecessors, (245), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-12-14 04:55:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 300 transitions. [2022-12-14 04:55:10,724 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 300 transitions. Word has length 24 [2022-12-14 04:55:10,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:10,724 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 300 transitions. [2022-12-14 04:55:10,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 300 transitions. [2022-12-14 04:55:10,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 04:55:10,725 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:10,725 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:10,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 04:55:10,726 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:10,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:10,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1441791788, now seen corresponding path program 1 times [2022-12-14 04:55:10,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:10,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972498530] [2022-12-14 04:55:10,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:10,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 04:55:10,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:10,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972498530] [2022-12-14 04:55:10,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972498530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:55:10,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:55:10,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 04:55:10,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377886530] [2022-12-14 04:55:10,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:55:10,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 04:55:10,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:10,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 04:55:10,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 04:55:10,957 INFO L87 Difference]: Start difference. First operand 251 states and 300 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:11,258 INFO L93 Difference]: Finished difference Result 260 states and 310 transitions. [2022-12-14 04:55:11,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 04:55:11,258 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 04:55:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:11,259 INFO L225 Difference]: With dead ends: 260 [2022-12-14 04:55:11,259 INFO L226 Difference]: Without dead ends: 260 [2022-12-14 04:55:11,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-14 04:55:11,260 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 15 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:11,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1002 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:55:11,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-12-14 04:55:11,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2022-12-14 04:55:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 138 states have (on average 1.826086956521739) internal successors, (252), 235 states have internal predecessors, (252), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (25), 14 states have call predecessors, (25), 18 states have call successors, (25) [2022-12-14 04:55:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 309 transitions. [2022-12-14 04:55:11,267 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 309 transitions. Word has length 26 [2022-12-14 04:55:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:11,268 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 309 transitions. [2022-12-14 04:55:11,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:55:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 309 transitions. [2022-12-14 04:55:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 04:55:11,269 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:11,269 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:11,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 04:55:11,269 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:11,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:11,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1600203618, now seen corresponding path program 1 times [2022-12-14 04:55:11,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:11,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205922615] [2022-12-14 04:55:11,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:11,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 04:55:11,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:11,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205922615] [2022-12-14 04:55:11,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205922615] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:55:11,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977872439] [2022-12-14 04:55:11,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:11,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:55:11,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:55:11,725 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:55:11,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 04:55:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:11,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 04:55:11,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:55:11,941 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 6 treesize of output 5 [2022-12-14 04:55:11,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 04:55:12,098 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-14 04:55:12,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-12-14 04:55:12,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:55:12,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 04:55:12,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:55:12,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 04:55:12,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-14 04:55:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 04:55:12,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:55:12,394 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| Int) (v_ArrVal_532 (Array Int Int))) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| 1) (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| v_ArrVal_532) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)) 1))) is different from false [2022-12-14 04:55:12,408 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| Int) (v_ArrVal_532 (Array Int Int))) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| 1) (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| v_ArrVal_532) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|)) 1))) is different from false [2022-12-14 04:55:12,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:55:12,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-14 04:55:12,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2022-12-14 04:55:12,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-12-14 04:55:12,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 04:55:12,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:55:12,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-12-14 04:55:12,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:55:12,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:55:12,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2022-12-14 04:55:21,383 WARN L233 SmtUtils]: Spent 7.53s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:55:32,566 WARN L233 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:55:32,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-12-14 04:55:32,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-12-14 04:55:32,670 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 04:55:32,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977872439] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:55:32,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1532486880] [2022-12-14 04:55:32,689 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-12-14 04:55:32,690 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:55:32,694 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 04:55:32,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:55:32,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 30 [2022-12-14 04:55:32,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011157512] [2022-12-14 04:55:32,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:55:32,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 04:55:32,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:32,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 04:55:32,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=723, Unknown=15, NotChecked=110, Total=930 [2022-12-14 04:55:32,699 INFO L87 Difference]: Start difference. First operand 259 states and 309 transitions. Second operand has 31 states, 25 states have (on average 2.2) internal successors, (55), 26 states have internal predecessors, (55), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 04:55:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:34,119 INFO L93 Difference]: Finished difference Result 261 states and 310 transitions. [2022-12-14 04:55:34,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 04:55:34,120 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 2.2) internal successors, (55), 26 states have internal predecessors, (55), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-12-14 04:55:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:34,121 INFO L225 Difference]: With dead ends: 261 [2022-12-14 04:55:34,121 INFO L226 Difference]: Without dead ends: 261 [2022-12-14 04:55:34,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=233, Invalid=1238, Unknown=19, NotChecked=150, Total=1640 [2022-12-14 04:55:34,122 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 142 mSDsluCounter, 2161 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 2361 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 284 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:34,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 2361 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1557 Invalid, 0 Unknown, 284 Unchecked, 1.0s Time] [2022-12-14 04:55:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-12-14 04:55:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2022-12-14 04:55:34,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 138 states have (on average 1.818840579710145) internal successors, (251), 234 states have internal predecessors, (251), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-12-14 04:55:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 306 transitions. [2022-12-14 04:55:34,129 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 306 transitions. Word has length 37 [2022-12-14 04:55:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:34,130 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 306 transitions. [2022-12-14 04:55:34,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 2.2) internal successors, (55), 26 states have internal predecessors, (55), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 04:55:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 306 transitions. [2022-12-14 04:55:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 04:55:34,131 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:34,131 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:34,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 04:55:34,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 04:55:34,332 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~VOIDErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:34,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:34,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1600203617, now seen corresponding path program 1 times [2022-12-14 04:55:34,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:34,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918481948] [2022-12-14 04:55:34,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:34,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 04:55:34,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:34,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918481948] [2022-12-14 04:55:34,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918481948] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:55:34,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523540233] [2022-12-14 04:55:34,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:34,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:55:34,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:55:34,856 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:55:34,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 04:55:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:34,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-14 04:55:34,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:55:35,014 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 6 treesize of output 5 [2022-12-14 04:55:35,020 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 6 treesize of output 5 [2022-12-14 04:55:35,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 04:55:35,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 04:55:35,279 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-14 04:55:35,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-14 04:55:35,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 04:55:35,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:55:35,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 04:55:35,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:55:35,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 04:55:35,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:55:35,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 04:55:35,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:55:35,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 04:55:35,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 04:55:35,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-14 04:55:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 04:55:35,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:55:35,542 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_697) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_698) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|)))) (forall ((v_ArrVal_697 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_697) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|) 4)))) is different from false [2022-12-14 04:55:38,244 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:55:38,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 93 [2022-12-14 04:55:38,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 116 [2022-12-14 04:55:38,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 230 [2022-12-14 04:55:38,262 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:55:38,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 183 [2022-12-14 04:55:38,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 248 [2022-12-14 04:55:38,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 209 [2022-12-14 04:55:38,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 197 [2022-12-14 04:55:38,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:55:38,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 202 [2022-12-14 04:55:38,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 191 [2022-12-14 04:55:39,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:55:39,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-12-14 04:55:39,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:55:39,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-12-14 04:55:39,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:55:39,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:55:39,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-12-14 04:55:39,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:55:39,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:55:39,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 04:55:39,316 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:55:39,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-12-14 04:55:39,318 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:55:39,323 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:55:39,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2022-12-14 04:55:53,665 WARN L233 SmtUtils]: Spent 14.27s on a formula simplification. DAG size of input: 39 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:55:53,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:55:53,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 52 [2022-12-14 04:55:53,933 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-12-14 04:55:53,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523540233] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:55:53,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1825075897] [2022-12-14 04:55:53,935 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-12-14 04:55:53,935 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:55:53,935 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 04:55:53,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:55:53,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2022-12-14 04:55:53,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962896548] [2022-12-14 04:55:53,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:55:53,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 04:55:53,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:53,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 04:55:53,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=908, Unknown=2, NotChecked=60, Total=1056 [2022-12-14 04:55:53,938 INFO L87 Difference]: Start difference. First operand 258 states and 306 transitions. Second operand has 33 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 04:55:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:57,063 INFO L93 Difference]: Finished difference Result 257 states and 305 transitions. [2022-12-14 04:55:57,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 04:55:57,063 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-12-14 04:55:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:57,064 INFO L225 Difference]: With dead ends: 257 [2022-12-14 04:55:57,064 INFO L226 Difference]: Without dead ends: 257 [2022-12-14 04:55:57,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=309, Invalid=1585, Unknown=2, NotChecked=84, Total=1980 [2022-12-14 04:55:57,065 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 94 mSDsluCounter, 3098 mSDsCounter, 0 mSdLazyCounter, 3215 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 3298 SdHoareTripleChecker+Invalid, 3386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:57,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 3298 Invalid, 3386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3215 Invalid, 0 Unknown, 127 Unchecked, 2.2s Time] [2022-12-14 04:55:57,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-12-14 04:55:57,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2022-12-14 04:55:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 138 states have (on average 1.8115942028985508) internal successors, (250), 233 states have internal predecessors, (250), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-12-14 04:55:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 305 transitions. [2022-12-14 04:55:57,070 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 305 transitions. Word has length 37 [2022-12-14 04:55:57,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:57,070 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 305 transitions. [2022-12-14 04:55:57,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 04:55:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 305 transitions. [2022-12-14 04:55:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 04:55:57,071 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:57,071 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:57,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 04:55:57,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 04:55:57,273 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:57,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:57,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1962745778, now seen corresponding path program 1 times [2022-12-14 04:55:57,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:57,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381763185] [2022-12-14 04:55:57,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:57,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 04:55:57,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:57,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381763185] [2022-12-14 04:55:57,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381763185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:55:57,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:55:57,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 04:55:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671967223] [2022-12-14 04:55:57,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:55:57,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 04:55:57,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:55:57,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 04:55:57,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:55:57,415 INFO L87 Difference]: Start difference. First operand 257 states and 305 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 04:55:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:55:57,516 INFO L93 Difference]: Finished difference Result 246 states and 282 transitions. [2022-12-14 04:55:57,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 04:55:57,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-12-14 04:55:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:55:57,518 INFO L225 Difference]: With dead ends: 246 [2022-12-14 04:55:57,518 INFO L226 Difference]: Without dead ends: 246 [2022-12-14 04:55:57,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:55:57,519 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 19 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:55:57,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 802 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:55:57,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-12-14 04:55:57,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-12-14 04:55:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 130 states have (on average 1.823076923076923) internal successors, (237), 225 states have internal predecessors, (237), 29 states have call successors, (29), 11 states have call predecessors, (29), 9 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2022-12-14 04:55:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 282 transitions. [2022-12-14 04:55:57,525 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 282 transitions. Word has length 40 [2022-12-14 04:55:57,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:55:57,525 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 282 transitions. [2022-12-14 04:55:57,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 04:55:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 282 transitions. [2022-12-14 04:55:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 04:55:57,526 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:55:57,527 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:55:57,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 04:55:57,527 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:55:57,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:55:57,527 INFO L85 PathProgramCache]: Analyzing trace with hash -129068744, now seen corresponding path program 1 times [2022-12-14 04:55:57,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:55:57,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879796835] [2022-12-14 04:55:57,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:57,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:55:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 04:55:58,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:55:58,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879796835] [2022-12-14 04:55:58,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879796835] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:55:58,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7784431] [2022-12-14 04:55:58,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:55:58,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:55:58,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:55:58,099 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:55:58,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 04:55:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:55:58,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-14 04:55:58,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:55:58,247 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 6 treesize of output 5 [2022-12-14 04:55:58,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 04:55:58,431 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-12-14 04:55:58,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2022-12-14 04:56:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 04:56:06,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:56:07,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7784431] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:56:07,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1987751057] [2022-12-14 04:56:07,254 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-12-14 04:56:07,254 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:56:07,254 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 04:56:07,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 04:56:07,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2022-12-14 04:56:07,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580904808] [2022-12-14 04:56:07,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 04:56:07,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 04:56:07,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:56:07,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 04:56:07,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=831, Unknown=12, NotChecked=0, Total=930 [2022-12-14 04:56:07,257 INFO L87 Difference]: Start difference. First operand 246 states and 282 transitions. Second operand has 30 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-14 04:56:09,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:56:11,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:56:15,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:56:17,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:56:19,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:56:22,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:56:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:56:23,353 INFO L93 Difference]: Finished difference Result 249 states and 284 transitions. [2022-12-14 04:56:23,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 04:56:23,353 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-12-14 04:56:23,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:56:23,355 INFO L225 Difference]: With dead ends: 249 [2022-12-14 04:56:23,355 INFO L226 Difference]: Without dead ends: 246 [2022-12-14 04:56:23,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=229, Invalid=1560, Unknown=17, NotChecked=0, Total=1806 [2022-12-14 04:56:23,356 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 167 mSDsluCounter, 1737 mSDsCounter, 0 mSdLazyCounter, 2526 mSolverCounterSat, 54 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 2592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2526 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2022-12-14 04:56:23,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1881 Invalid, 2592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2526 Invalid, 12 Unknown, 0 Unchecked, 13.5s Time] [2022-12-14 04:56:23,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-12-14 04:56:23,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-12-14 04:56:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 130 states have (on average 1.8153846153846154) internal successors, (236), 225 states have internal predecessors, (236), 29 states have call successors, (29), 11 states have call predecessors, (29), 9 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2022-12-14 04:56:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 281 transitions. [2022-12-14 04:56:23,362 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 281 transitions. Word has length 46 [2022-12-14 04:56:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:56:23,362 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 281 transitions. [2022-12-14 04:56:23,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-14 04:56:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 281 transitions. [2022-12-14 04:56:23,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 04:56:23,363 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:56:23,363 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2022-12-14 04:56:23,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 04:56:23,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:56:23,564 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:56:23,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:56:23,564 INFO L85 PathProgramCache]: Analyzing trace with hash 557477989, now seen corresponding path program 1 times [2022-12-14 04:56:23,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:56:23,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097737971] [2022-12-14 04:56:23,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:56:23,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:56:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:56:24,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:56:24,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:56:24,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097737971] [2022-12-14 04:56:24,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097737971] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:56:24,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869319313] [2022-12-14 04:56:24,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:56:24,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:56:24,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:56:24,971 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:56:24,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 04:56:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:56:25,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 04:56:25,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:56:25,109 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 6 treesize of output 5 [2022-12-14 04:56:25,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 04:56:25,206 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1172 Int)) (= |c_#valid| (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1172))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-12-14 04:56:25,324 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1172 Int) (v_ArrVal_1173 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (let ((.cse0 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1172))) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1173)) (= (select .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0)))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-12-14 04:56:25,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:56:25,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 04:56:25,339 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) is different from true [2022-12-14 04:56:25,368 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1172 Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| Int) (v_ArrVal_1173 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (let ((.cse0 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1172))) (and (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47|) 0) (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| |c_#StackHeapBarrier|) (= |c_#valid| (store (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| v_ArrVal_1173) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-12-14 04:56:25,406 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1172 Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| Int) (v_ArrVal_1173 Int) (v_ArrVal_1175 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_43| Int)) (let ((.cse0 (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_43| v_ArrVal_1172))) (and (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47|) 0) (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| |c_#StackHeapBarrier|) (= |c_#valid| (store (store (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| v_ArrVal_1173) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_43| v_ArrVal_1175)) (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_43|)))) is different from true [2022-12-14 04:56:25,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:56:25,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:56:25,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:56:25,485 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 04:56:25,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 39 [2022-12-14 04:56:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2022-12-14 04:56:25,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:56:25,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869319313] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:56:25,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [705435154] [2022-12-14 04:56:25,702 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-12-14 04:56:25,702 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:56:25,703 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 04:56:25,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 04:56:25,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11] total 30 [2022-12-14 04:56:25,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157957731] [2022-12-14 04:56:25,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 04:56:25,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 04:56:25,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:56:25,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 04:56:25,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=628, Unknown=5, NotChecked=270, Total=992 [2022-12-14 04:56:25,705 INFO L87 Difference]: Start difference. First operand 246 states and 281 transitions. Second operand has 31 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 28 states have internal predecessors, (66), 8 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-12-14 04:56:52,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:56:52,289 INFO L93 Difference]: Finished difference Result 270 states and 316 transitions. [2022-12-14 04:56:52,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 04:56:52,290 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 28 states have internal predecessors, (66), 8 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 47 [2022-12-14 04:56:52,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:56:52,291 INFO L225 Difference]: With dead ends: 270 [2022-12-14 04:56:52,292 INFO L226 Difference]: Without dead ends: 270 [2022-12-14 04:56:52,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=220, Invalid=1591, Unknown=15, NotChecked=430, Total=2256 [2022-12-14 04:56:52,292 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 150 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 3014 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 4368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3014 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1313 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-12-14 04:56:52,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1488 Invalid, 4368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3014 Invalid, 1 Unknown, 1313 Unchecked, 2.7s Time] [2022-12-14 04:56:52,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-12-14 04:56:52,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 254. [2022-12-14 04:56:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 136 states have (on average 1.8014705882352942) internal successors, (245), 229 states have internal predecessors, (245), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-12-14 04:56:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 293 transitions. [2022-12-14 04:56:52,297 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 293 transitions. Word has length 47 [2022-12-14 04:56:52,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:56:52,297 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 293 transitions. [2022-12-14 04:56:52,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 28 states have internal predecessors, (66), 8 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-12-14 04:56:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 293 transitions. [2022-12-14 04:56:52,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 04:56:52,297 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:56:52,297 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2022-12-14 04:56:52,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 04:56:52,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:56:52,498 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting dll_insert_masterErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:56:52,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:56:52,498 INFO L85 PathProgramCache]: Analyzing trace with hash 557477990, now seen corresponding path program 1 times [2022-12-14 04:56:52,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:56:52,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758704278] [2022-12-14 04:56:52,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:56:52,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:56:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:56:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 04:56:53,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:56:53,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758704278] [2022-12-14 04:56:53,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758704278] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:56:53,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143040497] [2022-12-14 04:56:53,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:56:53,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:56:53,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:56:53,275 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:56:53,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 04:56:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:56:53,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-14 04:56:53,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:56:53,446 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 6 treesize of output 5 [2022-12-14 04:56:53,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 04:56:53,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 04:56:53,561 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1377 Int)) (= (store |c_old(#length)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1377) |c_#length|)) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|) (exists ((v_ArrVal_1378 Int)) (= |c_#valid| (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1378)))) is different from true [2022-12-14 04:56:53,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:56:53,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-14 04:56:53,916 WARN L859 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_~#dll~0.base| Int)) (and (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|) (exists ((v_ArrVal_1380 Int) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_1378 Int) (v_ArrVal_1377 Int) (v_ArrVal_1379 Int)) (let ((.cse1 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_1378))) (let ((.cse0 (store .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1379))) (and (= (select .cse0 |dll_create_generic_~#dll~0.base|) 1) (= (select .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select .cse0 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 0) (= (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_1377) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1380) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| (select |c_#length| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|)) |c_#length|))))))) is different from true [2022-12-14 04:56:54,004 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1380 Int) (|dll_create_generic_~#dll~0.base| Int) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_1378 Int) (v_ArrVal_1377 Int) (v_ArrVal_1379 Int)) (let ((.cse1 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_1378))) (let ((.cse0 (store .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1379))) (and (= (select .cse0 |dll_create_generic_~#dll~0.base|) 1) (= (select .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select .cse0 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 0) (= (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_1377) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1380) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| (select |c_#length| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|)) |c_#length|))))) is different from true [2022-12-14 04:56:54,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:56:54,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:56:54,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:56:54,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:56:54,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:56:54,054 INFO L321 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-12-14 04:56:54,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 25 [2022-12-14 04:56:54,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:56:54,083 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-14 04:56:54,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 63 [2022-12-14 04:56:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 04:56:54,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:56:56,559 WARN L837 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1419 Int) (v_ArrVal_1418 Int) (|v_dll_create_generic_~#dll~0.base_62| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_78| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_71| Int)) (let ((.cse0 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_62| v_ArrVal_1419))) (let ((.cse1 (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_78| v_ArrVal_1418))) (or (not (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_78|) 0)) (not (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_71|) 0)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_78| |c_#StackHeapBarrier|)) (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_62|)) (not (= (select .cse1 |v_dll_create_generic_~#dll~0.base_62|) 1)))))) (<= 0 (+ |c_dll_insert_master_~item~1#1.offset| 8))) (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_78| Int)) (or (forall ((|v_dll_create_generic_~#dll~0.base_62| Int)) (or (forall ((v_ArrVal_1419 Int)) (let ((.cse2 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_62| v_ArrVal_1419))) (or (not (= (select .cse2 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_78|) 0)) (forall ((v_ArrVal_1418 Int)) (let ((.cse3 (store .cse2 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_78| v_ArrVal_1418))) (or (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_71| Int)) (or (not (= (select .cse3 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_71|) 0)) (forall ((v_ArrVal_1420 Int) (v_ArrVal_1417 Int) (v_ArrVal_1416 Int)) (<= (+ |c_dll_insert_master_~item~1#1.offset| 12) (select (store (store (store |c_#length| |v_dll_create_generic_~#dll~0.base_62| v_ArrVal_1416) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_78| v_ArrVal_1420) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_71| v_ArrVal_1417) |c_dll_insert_master_~item~1#1.base|))))) (not (= (select .cse3 |v_dll_create_generic_~#dll~0.base_62|) 1)))))))) (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_62|)))) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_78| |c_#StackHeapBarrier|))))) is different from false [2022-12-14 04:56:56,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143040497] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:56:56,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [641755220] [2022-12-14 04:56:56,564 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-12-14 04:56:56,564 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:56:56,565 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 04:56:56,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 04:56:56,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2022-12-14 04:56:56,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280170212] [2022-12-14 04:56:56,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 04:56:56,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 04:56:56,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:56:56,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 04:56:56,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=465, Unknown=4, NotChecked=188, Total=756 [2022-12-14 04:56:56,566 INFO L87 Difference]: Start difference. First operand 254 states and 293 transitions. Second operand has 26 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 8 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-12-14 04:57:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:57:09,366 INFO L93 Difference]: Finished difference Result 261 states and 302 transitions. [2022-12-14 04:57:09,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 04:57:09,366 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 8 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 47 [2022-12-14 04:57:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:57:09,367 INFO L225 Difference]: With dead ends: 261 [2022-12-14 04:57:09,367 INFO L226 Difference]: Without dead ends: 261 [2022-12-14 04:57:09,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=171, Invalid=833, Unknown=4, NotChecked=252, Total=1260 [2022-12-14 04:57:09,368 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 193 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 740 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 04:57:09,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 913 Invalid, 2571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1787 Invalid, 0 Unknown, 740 Unchecked, 1.6s Time] [2022-12-14 04:57:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-12-14 04:57:09,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 254. [2022-12-14 04:57:09,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 136 states have (on average 1.786764705882353) internal successors, (243), 229 states have internal predecessors, (243), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-12-14 04:57:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 291 transitions. [2022-12-14 04:57:09,372 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 291 transitions. Word has length 47 [2022-12-14 04:57:09,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:57:09,372 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 291 transitions. [2022-12-14 04:57:09,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 8 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-12-14 04:57:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 291 transitions. [2022-12-14 04:57:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 04:57:09,373 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:57:09,373 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2022-12-14 04:57:09,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-14 04:57:09,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-14 04:57:09,575 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting dll_insert_masterErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:57:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:57:09,576 INFO L85 PathProgramCache]: Analyzing trace with hash 101967615, now seen corresponding path program 1 times [2022-12-14 04:57:09,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:57:09,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943423258] [2022-12-14 04:57:09,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:57:09,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:57:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:57:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:57:11,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:57:11,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943423258] [2022-12-14 04:57:11,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943423258] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:57:11,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177935048] [2022-12-14 04:57:11,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:57:11,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:57:11,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:57:11,271 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:57:11,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 04:57:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:57:11,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 04:57:11,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:57:11,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 04:57:11,487 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1612 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1612))))) is different from true [2022-12-14 04:57:13,599 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) is different from true [2022-12-14 04:57:21,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:57:21,907 INFO L321 Elim1Store]: treesize reduction 67, result has 31.6 percent of original size [2022-12-14 04:57:21,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 42 [2022-12-14 04:57:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2022-12-14 04:57:21,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:57:22,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177935048] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:57:22,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [251931086] [2022-12-14 04:57:22,076 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 04:57:22,077 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:57:22,077 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 04:57:22,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 04:57:22,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15] total 33 [2022-12-14 04:57:22,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177842508] [2022-12-14 04:57:22,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 04:57:22,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 04:57:22,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:57:22,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 04:57:22,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=953, Unknown=6, NotChecked=126, Total=1190 [2022-12-14 04:57:22,078 INFO L87 Difference]: Start difference. First operand 254 states and 291 transitions. Second operand has 34 states, 28 states have (on average 2.142857142857143) internal successors, (60), 29 states have internal predecessors, (60), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-12-14 04:57:24,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:57:57,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:57:57,258 INFO L93 Difference]: Finished difference Result 264 states and 305 transitions. [2022-12-14 04:57:57,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 04:57:57,258 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 2.142857142857143) internal successors, (60), 29 states have internal predecessors, (60), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 48 [2022-12-14 04:57:57,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:57:57,260 INFO L225 Difference]: With dead ends: 264 [2022-12-14 04:57:57,260 INFO L226 Difference]: Without dead ends: 264 [2022-12-14 04:57:57,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=359, Invalid=2829, Unknown=12, NotChecked=222, Total=3422 [2022-12-14 04:57:57,260 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 225 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 3202 mSolverCounterSat, 51 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1765 SdHoareTripleChecker+Invalid, 3752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3202 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 495 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-12-14 04:57:57,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1765 Invalid, 3752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3202 Invalid, 4 Unknown, 495 Unchecked, 6.4s Time] [2022-12-14 04:57:57,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-12-14 04:57:57,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 256. [2022-12-14 04:57:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 138 states have (on average 1.789855072463768) internal successors, (247), 231 states have internal predecessors, (247), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-12-14 04:57:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 295 transitions. [2022-12-14 04:57:57,264 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 295 transitions. Word has length 48 [2022-12-14 04:57:57,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:57:57,264 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 295 transitions. [2022-12-14 04:57:57,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 2.142857142857143) internal successors, (60), 29 states have internal predecessors, (60), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-12-14 04:57:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 295 transitions. [2022-12-14 04:57:57,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 04:57:57,264 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:57:57,265 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2022-12-14 04:57:57,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 04:57:57,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:57:57,466 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting dll_insert_masterErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:57:57,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:57:57,467 INFO L85 PathProgramCache]: Analyzing trace with hash 101967616, now seen corresponding path program 1 times [2022-12-14 04:57:57,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:57:57,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314436283] [2022-12-14 04:57:57,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:57:57,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:57:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:57:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:57:59,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:57:59,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314436283] [2022-12-14 04:57:59,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314436283] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:57:59,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152274927] [2022-12-14 04:57:59,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:57:59,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:57:59,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:57:59,290 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:57:59,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 04:57:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:57:59,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 04:57:59,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:57:59,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 04:57:59,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 04:57:59,738 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1828 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1828) |c_#length|)))) is different from true [2022-12-14 04:58:01,849 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1829 Int)) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1829))))) is different from true [2022-12-14 04:58:06,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:58:06,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:58:06,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:58:06,216 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 04:58:06,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 37 [2022-12-14 04:58:06,228 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 04:58:06,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 04:58:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2022-12-14 04:58:06,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:58:14,471 WARN L233 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:58:14,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152274927] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:58:14,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2067395455] [2022-12-14 04:58:14,473 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 04:58:14,473 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:58:14,473 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 04:58:14,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 04:58:14,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15] total 39 [2022-12-14 04:58:14,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961468285] [2022-12-14 04:58:14,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 04:58:14,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-14 04:58:14,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:14,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-14 04:58:14,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1329, Unknown=4, NotChecked=150, Total=1640 [2022-12-14 04:58:14,475 INFO L87 Difference]: Start difference. First operand 256 states and 295 transitions. Second operand has 40 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 32 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 04:58:16,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:58:18,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:58:29,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:58:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:49,828 INFO L93 Difference]: Finished difference Result 261 states and 301 transitions. [2022-12-14 04:58:49,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 04:58:49,828 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 32 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 48 [2022-12-14 04:58:49,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:49,830 INFO L225 Difference]: With dead ends: 261 [2022-12-14 04:58:49,830 INFO L226 Difference]: Without dead ends: 261 [2022-12-14 04:58:49,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 42.3s TimeCoverageRelationStatistics Valid=420, Invalid=3238, Unknown=10, NotChecked=238, Total=3906 [2022-12-14 04:58:49,832 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 431 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 2469 mSolverCounterSat, 150 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 3168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 2469 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 509 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:49,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1353 Invalid, 3168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 2469 Invalid, 40 Unknown, 509 Unchecked, 8.3s Time] [2022-12-14 04:58:49,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-12-14 04:58:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 260. [2022-12-14 04:58:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 140 states have (on average 1.7642857142857142) internal successors, (247), 234 states have internal predecessors, (247), 30 states have call successors, (30), 11 states have call predecessors, (30), 12 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2022-12-14 04:58:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 299 transitions. [2022-12-14 04:58:49,840 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 299 transitions. Word has length 48 [2022-12-14 04:58:49,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:49,840 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 299 transitions. [2022-12-14 04:58:49,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 32 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 04:58:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 299 transitions. [2022-12-14 04:58:49,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 04:58:49,841 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:49,841 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:58:49,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 04:58:50,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 04:58:50,043 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting dll_insert_masterErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:58:50,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:50,044 INFO L85 PathProgramCache]: Analyzing trace with hash 705354207, now seen corresponding path program 1 times [2022-12-14 04:58:50,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:50,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822615151] [2022-12-14 04:58:50,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:50,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 04:58:50,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:50,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822615151] [2022-12-14 04:58:50,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822615151] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:58:50,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231669110] [2022-12-14 04:58:50,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:50,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:50,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:58:50,296 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:58:50,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 04:58:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:50,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 04:58:50,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:50,502 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 04:58:50,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 04:58:50,507 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 04:58:50,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:58:50,660 INFO L321 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-12-14 04:58:50,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-12-14 04:58:50,685 INFO L321 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-12-14 04:58:50,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-12-14 04:58:50,713 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 04:58:50,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231669110] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:58:50,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [425017915] [2022-12-14 04:58:50,715 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-12-14 04:58:50,715 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:58:50,716 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 04:58:50,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:58:50,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-12-14 04:58:50,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094747657] [2022-12-14 04:58:50,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:58:50,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 04:58:50,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:50,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 04:58:50,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-14 04:58:50,717 INFO L87 Difference]: Start difference. First operand 260 states and 299 transitions. Second operand has 14 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-14 04:58:51,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:51,225 INFO L93 Difference]: Finished difference Result 258 states and 297 transitions. [2022-12-14 04:58:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 04:58:51,226 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) Word has length 60 [2022-12-14 04:58:51,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:51,227 INFO L225 Difference]: With dead ends: 258 [2022-12-14 04:58:51,227 INFO L226 Difference]: Without dead ends: 258 [2022-12-14 04:58:51,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-12-14 04:58:51,228 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 71 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:51,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1649 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 04:58:51,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-12-14 04:58:51,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-12-14 04:58:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 140 states have (on average 1.75) internal successors, (245), 232 states have internal predecessors, (245), 30 states have call successors, (30), 11 states have call predecessors, (30), 12 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2022-12-14 04:58:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 297 transitions. [2022-12-14 04:58:51,235 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 297 transitions. Word has length 60 [2022-12-14 04:58:51,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:51,236 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 297 transitions. [2022-12-14 04:58:51,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-14 04:58:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 297 transitions. [2022-12-14 04:58:51,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 04:58:51,236 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:51,236 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:58:51,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 04:58:51,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-14 04:58:51,437 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting dll_insert_masterErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:58:51,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:51,437 INFO L85 PathProgramCache]: Analyzing trace with hash 705354208, now seen corresponding path program 1 times [2022-12-14 04:58:51,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:51,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251528326] [2022-12-14 04:58:51,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:51,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 04:58:51,847 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:51,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251528326] [2022-12-14 04:58:51,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251528326] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:58:51,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158687818] [2022-12-14 04:58:51,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:51,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:51,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:58:51,848 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:58:51,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 04:58:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:52,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-14 04:58:52,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:52,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:58:52,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 04:58:52,167 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 04:58:52,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 04:58:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 04:58:52,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:59:00,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2022-12-14 04:59:00,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:59:00,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 62 [2022-12-14 04:59:00,636 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 04:59:00,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 04:59:00,644 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 04:59:00,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-14 04:59:00,690 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:59:00,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2022-12-14 04:59:00,699 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 04:59:00,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-14 04:59:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 04:59:00,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158687818] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:59:00,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [74087502] [2022-12-14 04:59:00,749 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-12-14 04:59:00,749 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:59:00,750 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 04:59:00,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:59:00,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 23 [2022-12-14 04:59:00,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75270384] [2022-12-14 04:59:00,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:59:00,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 04:59:00,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:59:00,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 04:59:00,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-12-14 04:59:00,751 INFO L87 Difference]: Start difference. First operand 258 states and 297 transitions. Second operand has 24 states, 17 states have (on average 3.411764705882353) internal successors, (58), 18 states have internal predecessors, (58), 10 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-12-14 04:59:01,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:01,789 INFO L93 Difference]: Finished difference Result 256 states and 295 transitions. [2022-12-14 04:59:01,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 04:59:01,789 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 17 states have (on average 3.411764705882353) internal successors, (58), 18 states have internal predecessors, (58), 10 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 60 [2022-12-14 04:59:01,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:01,790 INFO L225 Difference]: With dead ends: 256 [2022-12-14 04:59:01,790 INFO L226 Difference]: Without dead ends: 256 [2022-12-14 04:59:01,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2022-12-14 04:59:01,791 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 126 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:01,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1887 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 04:59:01,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-12-14 04:59:01,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-12-14 04:59:01,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 140 states have (on average 1.7357142857142858) internal successors, (243), 230 states have internal predecessors, (243), 30 states have call successors, (30), 11 states have call predecessors, (30), 12 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2022-12-14 04:59:01,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 295 transitions. [2022-12-14 04:59:01,795 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 295 transitions. Word has length 60 [2022-12-14 04:59:01,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:01,795 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 295 transitions. [2022-12-14 04:59:01,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 17 states have (on average 3.411764705882353) internal successors, (58), 18 states have internal predecessors, (58), 10 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-12-14 04:59:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 295 transitions. [2022-12-14 04:59:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 04:59:01,795 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:01,796 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1] [2022-12-14 04:59:01,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-14 04:59:01,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:59:01,997 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:59:01,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:01,998 INFO L85 PathProgramCache]: Analyzing trace with hash 496025889, now seen corresponding path program 1 times [2022-12-14 04:59:01,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:59:01,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190609817] [2022-12-14 04:59:01,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:01,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:59:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 04:59:04,312 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:59:04,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190609817] [2022-12-14 04:59:04,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190609817] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:59:04,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373474209] [2022-12-14 04:59:04,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:04,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:59:04,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:59:04,313 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:59:04,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 04:59:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:04,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 81 conjunts are in the unsatisfiable core [2022-12-14 04:59:04,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:04,542 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 6 treesize of output 5 [2022-12-14 04:59:04,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 04:59:04,733 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 04:59:04,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-12-14 04:59:04,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 04:59:04,834 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2585 Int)) (= |c_#valid| (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) v_ArrVal_2585))) is different from true [2022-12-14 04:59:04,936 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 04:59:04,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-12-14 04:59:05,143 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_2590 (Array Int Int))) (and (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~next~0#1.base| (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_2590) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)))) is different from true [2022-12-14 04:59:05,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:05,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-12-14 04:59:07,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:07,560 INFO L321 Elim1Store]: treesize reduction 146, result has 23.2 percent of original size [2022-12-14 04:59:07,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 88 [2022-12-14 04:59:07,579 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2022-12-14 04:59:07,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:59:07,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:59:07,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-12-14 04:59:07,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:59:07,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2022-12-14 04:59:08,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373474209] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:59:08,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [999959654] [2022-12-14 04:59:08,091 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 04:59:08,091 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:59:08,092 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 04:59:08,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 04:59:08,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21] total 42 [2022-12-14 04:59:08,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106292188] [2022-12-14 04:59:08,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 04:59:08,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 04:59:08,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:59:08,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 04:59:08,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1562, Unknown=5, NotChecked=162, Total=1892 [2022-12-14 04:59:08,095 INFO L87 Difference]: Start difference. First operand 256 states and 295 transitions. Second operand has 43 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 40 states have internal predecessors, (82), 9 states have call successors, (11), 3 states have call predecessors, (11), 8 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-12-14 04:59:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:22,188 INFO L93 Difference]: Finished difference Result 284 states and 336 transitions. [2022-12-14 04:59:22,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 04:59:22,188 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 40 states have internal predecessors, (82), 9 states have call successors, (11), 3 states have call predecessors, (11), 8 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) Word has length 61 [2022-12-14 04:59:22,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:22,189 INFO L225 Difference]: With dead ends: 284 [2022-12-14 04:59:22,189 INFO L226 Difference]: Without dead ends: 284 [2022-12-14 04:59:22,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=432, Invalid=3467, Unknown=15, NotChecked=246, Total=4160 [2022-12-14 04:59:22,190 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 218 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 3996 mSolverCounterSat, 74 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 4605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 3996 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 530 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:22,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1584 Invalid, 4605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 3996 Invalid, 5 Unknown, 530 Unchecked, 5.5s Time] [2022-12-14 04:59:22,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-12-14 04:59:22,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 265. [2022-12-14 04:59:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 146 states have (on average 1.726027397260274) internal successors, (252), 235 states have internal predecessors, (252), 31 states have call successors, (31), 11 states have call predecessors, (31), 14 states have return successors, (27), 21 states have call predecessors, (27), 17 states have call successors, (27) [2022-12-14 04:59:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 310 transitions. [2022-12-14 04:59:22,194 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 310 transitions. Word has length 61 [2022-12-14 04:59:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:22,194 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 310 transitions. [2022-12-14 04:59:22,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 40 states have internal predecessors, (82), 9 states have call successors, (11), 3 states have call predecessors, (11), 8 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-12-14 04:59:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 310 transitions. [2022-12-14 04:59:22,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 04:59:22,195 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:22,195 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1] [2022-12-14 04:59:22,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 04:59:22,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:59:22,397 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting dll_insert_masterErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:59:22,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:22,397 INFO L85 PathProgramCache]: Analyzing trace with hash 496025890, now seen corresponding path program 1 times [2022-12-14 04:59:22,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:59:22,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282573791] [2022-12-14 04:59:22,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:22,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:59:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 04:59:23,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:59:23,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282573791] [2022-12-14 04:59:23,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282573791] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:59:23,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188705138] [2022-12-14 04:59:23,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:23,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:59:23,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:59:23,637 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:59:23,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 04:59:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:23,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 173 conjunts are in the unsatisfiable core [2022-12-14 04:59:23,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:23,817 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 6 treesize of output 5 [2022-12-14 04:59:23,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 04:59:23,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 04:59:23,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 04:59:23,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 04:59:24,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 04:59:24,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:24,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:24,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2022-12-14 04:59:24,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2022-12-14 04:59:24,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:24,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:24,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 04:59:24,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 04:59:24,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 04:59:24,918 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset| |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) (= (select |c_#valid| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 1) (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) (exists ((v_ArrVal_2890 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_2890))) (or (exists ((v_ArrVal_2894 (Array Int Int))) (not (= (select (select (store |c_old(#memory_$Pointer$.offset)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_2894) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|) 0))) (exists ((v_ArrVal_2893 (Array Int Int))) (not (= (select (select (store |c_old(#memory_$Pointer$.base)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_2893) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|) 0)))) (= (select |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 0) (< |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2889 Int)) (= (store |c_old(#length)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_2889) |c_#length|))) is different from true [2022-12-14 04:59:24,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 04:59:25,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:25,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 79 [2022-12-14 04:59:25,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:25,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-12-14 04:59:25,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:25,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:25,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:25,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:25,287 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-14 04:59:25,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 34 [2022-12-14 04:59:25,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-12-14 04:59:25,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2022-12-14 04:59:26,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:26,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:26,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:26,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:26,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:26,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:26,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:26,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:26,164 INFO L321 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-12-14 04:59:26,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 38 [2022-12-14 04:59:26,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:26,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:26,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:26,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:26,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:26,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:26,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:26,203 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-12-14 04:59:26,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 80 [2022-12-14 04:59:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-12-14 04:59:26,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:59:27,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:59:27,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:59:27,895 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 04:59:27,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 66 [2022-12-14 04:59:27,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2022-12-14 04:59:27,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-12-14 04:59:36,350 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:59:36,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188705138] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:59:36,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [525650631] [2022-12-14 04:59:36,354 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 04:59:36,354 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:59:36,354 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 04:59:36,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 04:59:36,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 30] total 42 [2022-12-14 04:59:36,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768581260] [2022-12-14 04:59:36,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 04:59:36,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 04:59:36,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:59:36,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 04:59:36,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1649, Unknown=16, NotChecked=84, Total=1980 [2022-12-14 04:59:36,357 INFO L87 Difference]: Start difference. First operand 265 states and 310 transitions. Second operand has 43 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 37 states have internal predecessors, (82), 10 states have call successors, (12), 4 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-12-14 04:59:38,128 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset| |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) (= (select |c_#valid| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 1) (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) (exists ((v_ArrVal_2890 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_2890))) (= (store |c_old(#length)| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| (select |c_#length| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|)) |c_#length|) (exists ((v_ArrVal_2893 (Array Int Int))) (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~next~0#1.base| (select (select (store |c_old(#memory_$Pointer$.base)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_2893) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|))) (= (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| (select |c_#valid| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|)) |c_#valid|) (= (select |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (or (exists ((v_ArrVal_2894 (Array Int Int))) (not (= (select (select (store |c_old(#memory_$Pointer$.offset)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_2894) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|) 0))) (exists ((v_ArrVal_2893 (Array Int Int))) (not (= (select (select (store |c_old(#memory_$Pointer$.base)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_2893) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|) 0)))) (= (select |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 0) (exists ((v_ArrVal_2894 (Array Int Int))) (= (select (select (store |c_old(#memory_$Pointer$.offset)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_2894) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~next~0#1.offset|)) (< |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2889 Int)) (= (store |c_old(#length)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_2889) |c_#length|))) is different from true [2022-12-14 04:59:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:40,952 INFO L93 Difference]: Finished difference Result 272 states and 319 transitions. [2022-12-14 04:59:40,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 04:59:40,953 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 37 states have internal predecessors, (82), 10 states have call successors, (12), 4 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 61 [2022-12-14 04:59:40,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:40,954 INFO L225 Difference]: With dead ends: 272 [2022-12-14 04:59:40,954 INFO L226 Difference]: Without dead ends: 272 [2022-12-14 04:59:40,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=348, Invalid=2496, Unknown=26, NotChecked=210, Total=3080 [2022-12-14 04:59:40,956 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 183 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 3046 mSolverCounterSat, 47 mSolverCounterUnsat, 54 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 3401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3046 IncrementalHoareTripleChecker+Invalid, 54 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:40,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1292 Invalid, 3401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3046 Invalid, 54 Unknown, 254 Unchecked, 3.3s Time] [2022-12-14 04:59:40,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-12-14 04:59:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 265. [2022-12-14 04:59:40,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 146 states have (on average 1.7123287671232876) internal successors, (250), 235 states have internal predecessors, (250), 31 states have call successors, (31), 11 states have call predecessors, (31), 14 states have return successors, (27), 21 states have call predecessors, (27), 17 states have call successors, (27) [2022-12-14 04:59:40,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 308 transitions. [2022-12-14 04:59:40,962 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 308 transitions. Word has length 61 [2022-12-14 04:59:40,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:40,962 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 308 transitions. [2022-12-14 04:59:40,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 37 states have internal predecessors, (82), 10 states have call successors, (12), 4 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-12-14 04:59:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 308 transitions. [2022-12-14 04:59:40,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-14 04:59:40,963 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:40,963 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:59:40,969 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 04:59:41,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-14 04:59:41,165 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 04:59:41,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2048736162, now seen corresponding path program 1 times [2022-12-14 04:59:41,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:59:41,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025188970] [2022-12-14 04:59:41,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:41,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:59:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 04:59:41,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:59:41,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025188970] [2022-12-14 04:59:41,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025188970] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:59:41,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599610301] [2022-12-14 04:59:41,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:41,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:59:41,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:59:41,689 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:59:41,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 04:59:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:41,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 04:59:41,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:42,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 04:59:42,259 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 04:59:42,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 04:59:42,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:42,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 04:59:42,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:42,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 04:59:42,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:59:42,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 04:59:42,395 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:59:42,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-14 04:59:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 04:59:42,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:59:44,489 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| Int) (v_ArrVal_3251 (Array Int Int))) (or (not (< |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| 1) (select (select (store |c_#memory_$Pointer$.base| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| v_ArrVal_3251) |c_dll_insert_master_#in~dll#1.base|) |c_dll_insert_master_#in~dll#1.offset|)) 1))) is different from false [2022-12-14 04:59:44,503 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| Int) (v_ArrVal_3251 (Array Int Int))) (or (= (select (store |c_#valid| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| 1) (select (select (store |c_#memory_$Pointer$.base| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| v_ArrVal_3251) |c_##fun~$Pointer$~TO~VOID_#~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#~10#1.offset|)) 1) (not (< |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| |c_#StackHeapBarrier|)))) is different from false [2022-12-14 04:59:44,518 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| Int) (v_ArrVal_3251 (Array Int Int))) (or (not (< |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| 1) (select (select (store |c_#memory_$Pointer$.base| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| v_ArrVal_3251) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)) 1))) is different from false [2022-12-14 04:59:44,527 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| Int) (v_ArrVal_3251 (Array Int Int))) (or (not (< |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| 1) (select (select (store |c_#memory_$Pointer$.base| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| v_ArrVal_3251) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|)) 1))) is different from false [2022-12-14 04:59:44,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:59:44,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-12-14 04:59:44,648 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:59:44,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2022-12-14 04:59:44,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:59:44,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 70 [2022-12-14 04:59:44,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-12-14 04:59:44,993 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:59:44,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2022-12-14 04:59:45,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:59:45,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 120 [2022-12-14 04:59:45,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:59:45,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 122 treesize of output 204 [2022-12-14 04:59:45,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 112 [2022-12-14 04:59:45,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 108 [2022-12-14 04:59:50,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:59:50,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-12-14 04:59:50,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:59:50,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2022-12-14 04:59:50,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-14 04:59:50,643 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:59:50,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-12-14 04:59:50,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:59:50,652 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:59:50,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2022-12-14 05:00:14,005 WARN L233 SmtUtils]: Spent 23.21s on a formula simplification. DAG size of input: 52 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:00:14,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:00:14,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 134 treesize of output 202 [2022-12-14 05:00:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2022-12-14 05:00:18,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599610301] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:00:18,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [511876576] [2022-12-14 05:00:18,424 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-12-14 05:00:18,425 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:00:18,425 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 05:00:18,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:00:18,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 37 [2022-12-14 05:00:18,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521943212] [2022-12-14 05:00:18,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:00:18,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 05:00:18,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:00:18,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 05:00:18,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1007, Unknown=22, NotChecked=268, Total=1406 [2022-12-14 05:00:18,427 INFO L87 Difference]: Start difference. First operand 265 states and 308 transitions. Second operand has 38 states, 30 states have (on average 2.6) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-12-14 05:00:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:00:22,615 INFO L93 Difference]: Finished difference Result 266 states and 308 transitions. [2022-12-14 05:00:22,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 05:00:22,615 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 30 states have (on average 2.6) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) Word has length 63 [2022-12-14 05:00:22,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:00:22,616 INFO L225 Difference]: With dead ends: 266 [2022-12-14 05:00:22,616 INFO L226 Difference]: Without dead ends: 266 [2022-12-14 05:00:22,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 104 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=254, Invalid=1719, Unknown=23, NotChecked=356, Total=2352 [2022-12-14 05:00:22,617 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 109 mSDsluCounter, 3724 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 3925 SdHoareTripleChecker+Invalid, 2858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 576 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:00:22,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 3925 Invalid, 2858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2228 Invalid, 0 Unknown, 576 Unchecked, 1.5s Time] [2022-12-14 05:00:22,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-12-14 05:00:22,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-12-14 05:00:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 235 states have internal predecessors, (250), 31 states have call successors, (31), 11 states have call predecessors, (31), 15 states have return successors, (27), 22 states have call predecessors, (27), 17 states have call successors, (27) [2022-12-14 05:00:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 308 transitions. [2022-12-14 05:00:22,621 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 308 transitions. Word has length 63 [2022-12-14 05:00:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:00:22,621 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 308 transitions. [2022-12-14 05:00:22,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 30 states have (on average 2.6) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-12-14 05:00:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 308 transitions. [2022-12-14 05:00:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-14 05:00:22,622 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:00:22,622 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:00:22,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 05:00:22,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 05:00:22,822 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting dll_insert_masterErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 05:00:22,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:00:22,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2048736161, now seen corresponding path program 1 times [2022-12-14 05:00:22,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:00:22,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755307947] [2022-12-14 05:00:22,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:00:22,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:00:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:00:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 05:00:23,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:00:23,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755307947] [2022-12-14 05:00:23,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755307947] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:00:23,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802162951] [2022-12-14 05:00:23,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:00:23,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:00:23,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:00:23,473 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:00:23,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 05:00:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:00:23,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 89 conjunts are in the unsatisfiable core [2022-12-14 05:00:23,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:00:23,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:00:23,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:00:24,038 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-14 05:00:24,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-12-14 05:00:24,051 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-14 05:00:24,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-14 05:00:24,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:00:24,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 05:00:24,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:00:24,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 05:00:24,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:00:24,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 05:00:24,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:00:24,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 05:00:24,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:00:24,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 05:00:24,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:00:24,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 05:00:24,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-14 05:00:24,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 05:00:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 05:00:24,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:00:24,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:00:24,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 84 [2022-12-14 05:00:24,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 117 [2022-12-14 05:00:24,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:00:24,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 89 [2022-12-14 05:00:24,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 126 [2022-12-14 05:00:24,839 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:00:24,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 166 [2022-12-14 05:00:24,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 143 [2022-12-14 05:00:24,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 144 [2022-12-14 05:00:24,861 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:00:24,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 160 [2022-12-14 05:00:24,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 129 [2022-12-14 05:00:25,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:00:25,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 84 [2022-12-14 05:00:25,963 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:00:25,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2022-12-14 05:00:25,979 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 05:00:25,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 100 [2022-12-14 05:00:25,990 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 05:00:25,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 126 [2022-12-14 05:00:26,008 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:00:26,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 188 treesize of output 202 [2022-12-14 05:00:26,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 161 [2022-12-14 05:00:26,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 170 [2022-12-14 05:00:26,036 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:00:26,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 178 [2022-12-14 05:00:26,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 147 [2022-12-14 05:00:27,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:00:27,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-12-14 05:00:27,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:00:27,262 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:00:27,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2022-12-14 05:00:27,276 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:00:27,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-12-14 05:00:27,282 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:00:27,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-12-14 05:00:27,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:00:27,292 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:00:27,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-12-14 05:00:27,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:00:27,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:00:27,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 05:00:37,547 WARN L233 SmtUtils]: Spent 10.15s on a formula simplification. DAG size of input: 39 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:00:37,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 82 [2022-12-14 05:00:37,601 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:00:37,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 152 [2022-12-14 05:00:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 05:00:37,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802162951] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:00:37,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [27831337] [2022-12-14 05:00:37,938 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-12-14 05:00:37,938 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:00:37,938 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 05:00:37,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:00:37,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 35 [2022-12-14 05:00:37,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868050936] [2022-12-14 05:00:37,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:00:37,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 05:00:37,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:00:37,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 05:00:37,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1131, Unknown=19, NotChecked=0, Total=1260 [2022-12-14 05:00:37,940 INFO L87 Difference]: Start difference. First operand 266 states and 308 transitions. Second operand has 36 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 29 states have internal predecessors, (72), 13 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-12-14 05:00:40,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:00:40,533 INFO L93 Difference]: Finished difference Result 265 states and 307 transitions. [2022-12-14 05:00:40,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 05:00:40,534 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 29 states have internal predecessors, (72), 13 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) Word has length 63 [2022-12-14 05:00:40,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:00:40,535 INFO L225 Difference]: With dead ends: 265 [2022-12-14 05:00:40,535 INFO L226 Difference]: Without dead ends: 265 [2022-12-14 05:00:40,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=271, Invalid=1962, Unknown=23, NotChecked=0, Total=2256 [2022-12-14 05:00:40,536 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 93 mSDsluCounter, 2773 mSDsCounter, 0 mSdLazyCounter, 2484 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 2971 SdHoareTripleChecker+Invalid, 2520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:00:40,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 2971 Invalid, 2520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2484 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-12-14 05:00:40,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-12-14 05:00:40,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2022-12-14 05:00:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 147 states have (on average 1.6938775510204083) internal successors, (249), 234 states have internal predecessors, (249), 31 states have call successors, (31), 11 states have call predecessors, (31), 15 states have return successors, (27), 22 states have call predecessors, (27), 17 states have call successors, (27) [2022-12-14 05:00:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 307 transitions. [2022-12-14 05:00:40,539 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 307 transitions. Word has length 63 [2022-12-14 05:00:40,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:00:40,540 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 307 transitions. [2022-12-14 05:00:40,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 29 states have internal predecessors, (72), 13 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-12-14 05:00:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 307 transitions. [2022-12-14 05:00:40,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-14 05:00:40,540 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:00:40,540 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1] [2022-12-14 05:00:40,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-14 05:00:40,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:00:40,741 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting dll_insert_masterErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 05:00:40,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:00:40,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1803047485, now seen corresponding path program 1 times [2022-12-14 05:00:40,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:00:40,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159840767] [2022-12-14 05:00:40,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:00:40,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:00:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:00:41,879 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 05:00:41,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:00:41,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159840767] [2022-12-14 05:00:41,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159840767] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:00:41,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28628320] [2022-12-14 05:00:41,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:00:41,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:00:41,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:00:41,881 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:00:41,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 05:00:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:00:42,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 122 conjunts are in the unsatisfiable core [2022-12-14 05:00:42,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:00:42,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 05:00:42,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:00:42,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:00:42,696 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 05:00:45,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 166 [2022-12-14 05:00:45,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 152 [2022-12-14 05:00:45,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 136 [2022-12-14 05:00:45,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 132 [2022-12-14 05:00:45,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 128 [2022-12-14 05:00:45,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:00:45,949 INFO L321 Elim1Store]: treesize reduction 152, result has 25.1 percent of original size [2022-12-14 05:00:45,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 274 treesize of output 301 [2022-12-14 05:00:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:00:46,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:00:46,757 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:00:46,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 50 [2022-12-14 05:00:46,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 93 [2022-12-14 05:00:46,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28628320] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:00:46,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [285159495] [2022-12-14 05:00:46,897 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-12-14 05:00:46,897 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:00:46,897 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 05:00:46,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:00:46,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 30] total 37 [2022-12-14 05:00:46,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726991015] [2022-12-14 05:00:46,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:00:46,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 05:00:46,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:00:46,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 05:00:46,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1338, Unknown=5, NotChecked=0, Total=1482 [2022-12-14 05:00:46,899 INFO L87 Difference]: Start difference. First operand 265 states and 307 transitions. Second operand has 38 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-12-14 05:00:57,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:00:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:00:58,559 INFO L93 Difference]: Finished difference Result 277 states and 323 transitions. [2022-12-14 05:00:58,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 05:00:58,559 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) Word has length 62 [2022-12-14 05:00:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:00:58,560 INFO L225 Difference]: With dead ends: 277 [2022-12-14 05:00:58,560 INFO L226 Difference]: Without dead ends: 277 [2022-12-14 05:00:58,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=432, Invalid=3719, Unknown=9, NotChecked=0, Total=4160 [2022-12-14 05:00:58,561 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 230 mSDsluCounter, 1645 mSDsCounter, 0 mSdLazyCounter, 3276 mSolverCounterSat, 71 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3276 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:00:58,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1774 Invalid, 3362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3276 Invalid, 15 Unknown, 0 Unchecked, 6.4s Time] [2022-12-14 05:00:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-12-14 05:00:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 267. [2022-12-14 05:00:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 149 states have (on average 1.6979865771812082) internal successors, (253), 236 states have internal predecessors, (253), 31 states have call successors, (31), 11 states have call predecessors, (31), 15 states have return successors, (27), 22 states have call predecessors, (27), 17 states have call successors, (27) [2022-12-14 05:00:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 311 transitions. [2022-12-14 05:00:58,566 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 311 transitions. Word has length 62 [2022-12-14 05:00:58,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:00:58,566 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 311 transitions. [2022-12-14 05:00:58,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-12-14 05:00:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 311 transitions. [2022-12-14 05:00:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-14 05:00:58,566 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:00:58,566 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1] [2022-12-14 05:00:58,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 05:00:58,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:00:58,768 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting dll_insert_masterErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 05:00:58,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:00:58,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1803047484, now seen corresponding path program 1 times [2022-12-14 05:00:58,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:00:58,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889376568] [2022-12-14 05:00:58,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:00:58,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:00:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:01:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:01:01,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:01:01,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889376568] [2022-12-14 05:01:01,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889376568] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:01:01,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020312586] [2022-12-14 05:01:01,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:01:01,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:01:01,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:01:01,323 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:01:01,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 05:01:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:01:01,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 05:01:01,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:01:01,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 05:01:01,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 05:01:01,823 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4106 Int)) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4106))))) is different from true [2022-12-14 05:01:07,951 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4107 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4107) |c_#length|)))) is different from true [2022-12-14 05:01:14,339 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_4108 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4108) |c_#length|)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-14 05:01:29,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:01:29,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:01:29,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:01:29,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:01:29,236 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-14 05:01:29,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 52 [2022-12-14 05:01:29,249 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 05:01:29,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 05:01:29,300 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 7 refuted. 2 times theorem prover too weak. 6 trivial. 25 not checked. [2022-12-14 05:01:29,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:01:37,622 WARN L233 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:01:37,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020312586] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:01:37,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1631773086] [2022-12-14 05:01:37,623 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-12-14 05:01:37,624 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:01:37,624 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 05:01:37,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:01:37,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17] total 45 [2022-12-14 05:01:37,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772006868] [2022-12-14 05:01:37,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:01:37,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-14 05:01:37,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:01:37,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-14 05:01:37,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1708, Unknown=15, NotChecked=258, Total=2162 [2022-12-14 05:01:37,625 INFO L87 Difference]: Start difference. First operand 267 states and 311 transitions. Second operand has 46 states, 39 states have (on average 2.41025641025641) internal successors, (94), 38 states have internal predecessors, (94), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-12-14 05:01:39,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:01:41,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:01:43,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:01:51,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:02:00,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:02:02,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:02:04,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:02:12,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:02:54,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:03:05,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:03:05,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:03:05,977 INFO L93 Difference]: Finished difference Result 268 states and 311 transitions. [2022-12-14 05:03:05,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 05:03:05,978 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 39 states have (on average 2.41025641025641) internal successors, (94), 38 states have internal predecessors, (94), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 62 [2022-12-14 05:03:05,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:03:05,979 INFO L225 Difference]: With dead ends: 268 [2022-12-14 05:03:05,979 INFO L226 Difference]: Without dead ends: 268 [2022-12-14 05:03:05,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 100.8s TimeCoverageRelationStatistics Valid=506, Invalid=3762, Unknown=34, NotChecked=390, Total=4692 [2022-12-14 05:03:05,981 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 393 mSDsluCounter, 1671 mSDsCounter, 0 mSdLazyCounter, 3154 mSolverCounterSat, 132 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 4056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 3154 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 730 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:03:05,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1804 Invalid, 4056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 3154 Invalid, 40 Unknown, 730 Unchecked, 24.1s Time] [2022-12-14 05:03:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-12-14 05:03:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 263. [2022-12-14 05:03:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 145 states have (on average 1.703448275862069) internal successors, (247), 234 states have internal predecessors, (247), 31 states have call successors, (31), 11 states have call predecessors, (31), 15 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2022-12-14 05:03:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 305 transitions. [2022-12-14 05:03:05,985 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 305 transitions. Word has length 62 [2022-12-14 05:03:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:03:05,985 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 305 transitions. [2022-12-14 05:03:05,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 39 states have (on average 2.41025641025641) internal successors, (94), 38 states have internal predecessors, (94), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-12-14 05:03:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 305 transitions. [2022-12-14 05:03:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-14 05:03:05,986 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:03:05,987 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:03:05,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 05:03:06,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-14 05:03:06,187 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 05:03:06,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:03:06,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1152447770, now seen corresponding path program 1 times [2022-12-14 05:03:06,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:03:06,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235802303] [2022-12-14 05:03:06,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:03:06,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:03:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:03:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 159 proven. 39 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:03:10,518 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:03:10,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235802303] [2022-12-14 05:03:10,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235802303] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:03:10,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113449683] [2022-12-14 05:03:10,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:03:10,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:03:10,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:03:10,519 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:03:10,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 05:03:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:03:10,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 150 conjunts are in the unsatisfiable core [2022-12-14 05:03:10,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:03:10,940 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 6 treesize of output 5 [2022-12-14 05:03:11,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 05:03:11,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:03:11,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:11,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 05:03:11,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 05:03:12,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:12,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:12,079 INFO L321 Elim1Store]: treesize reduction 62, result has 25.3 percent of original size [2022-12-14 05:03:12,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 145 [2022-12-14 05:03:12,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 108 [2022-12-14 05:03:12,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:12,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:12,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:12,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 27 [2022-12-14 05:03:12,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:12,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:12,254 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 05:03:12,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2022-12-14 05:03:12,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 05:03:12,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:03:12,510 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (and (exists ((v_ArrVal_4670 Int)) (= |c_#valid| (store |c_old(#valid)| .cse0 v_ArrVal_4670))) (< .cse0 |c_#StackHeapBarrier|))) is different from true [2022-12-14 05:03:12,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2022-12-14 05:03:12,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:12,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:12,728 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 05:03:12,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 05:03:12,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 05:03:12,980 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_4677 (Array Int Int))) (and (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~next~0#1.base| (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4677) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)))) is different from true [2022-12-14 05:03:13,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:13,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-12-14 05:03:13,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:13,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:13,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:13,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:13,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:13,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:13,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:13,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:13,702 INFO L321 Elim1Store]: treesize reduction 169, result has 19.1 percent of original size [2022-12-14 05:03:13,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 75 [2022-12-14 05:03:13,780 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 144 proven. 38 refuted. 0 times theorem prover too weak. 35 trivial. 14 not checked. [2022-12-14 05:03:13,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:03:14,790 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:03:14,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 05:03:14,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:03:14,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2022-12-14 05:03:14,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113449683] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:03:14,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1486274617] [2022-12-14 05:03:14,989 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-12-14 05:03:14,989 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:03:14,990 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 05:03:14,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:03:14,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 64 [2022-12-14 05:03:14,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893475868] [2022-12-14 05:03:14,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:03:14,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-12-14 05:03:14,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:03:14,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-14 05:03:14,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=3741, Unknown=30, NotChecked=250, Total=4290 [2022-12-14 05:03:14,992 INFO L87 Difference]: Start difference. First operand 263 states and 305 transitions. Second operand has 65 states, 60 states have (on average 2.25) internal successors, (135), 60 states have internal predecessors, (135), 12 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (17), 13 states have call predecessors, (17), 12 states have call successors, (17) [2022-12-14 05:03:34,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:03:40,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:03:40,895 INFO L93 Difference]: Finished difference Result 297 states and 350 transitions. [2022-12-14 05:03:40,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 05:03:40,896 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 60 states have (on average 2.25) internal successors, (135), 60 states have internal predecessors, (135), 12 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (17), 13 states have call predecessors, (17), 12 states have call successors, (17) Word has length 124 [2022-12-14 05:03:40,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:03:40,897 INFO L225 Difference]: With dead ends: 297 [2022-12-14 05:03:40,897 INFO L226 Difference]: Without dead ends: 297 [2022-12-14 05:03:40,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2371 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=705, Invalid=7418, Unknown=75, NotChecked=358, Total=8556 [2022-12-14 05:03:40,898 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 266 mSDsluCounter, 2486 mSDsCounter, 0 mSdLazyCounter, 6065 mSolverCounterSat, 88 mSolverCounterUnsat, 68 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 2619 SdHoareTripleChecker+Invalid, 6752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 6065 IncrementalHoareTripleChecker+Invalid, 68 IncrementalHoareTripleChecker+Unknown, 531 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:03:40,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 2619 Invalid, 6752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 6065 Invalid, 68 Unknown, 531 Unchecked, 12.1s Time] [2022-12-14 05:03:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-12-14 05:03:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 272. [2022-12-14 05:03:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 151 states have (on average 1.695364238410596) internal successors, (256), 239 states have internal predecessors, (256), 32 states have call successors, (32), 11 states have call predecessors, (32), 17 states have return successors, (32), 24 states have call predecessors, (32), 18 states have call successors, (32) [2022-12-14 05:03:40,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 320 transitions. [2022-12-14 05:03:40,902 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 320 transitions. Word has length 124 [2022-12-14 05:03:40,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:03:40,902 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 320 transitions. [2022-12-14 05:03:40,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 60 states have (on average 2.25) internal successors, (135), 60 states have internal predecessors, (135), 12 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (17), 13 states have call predecessors, (17), 12 states have call successors, (17) [2022-12-14 05:03:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 320 transitions. [2022-12-14 05:03:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-14 05:03:40,903 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:03:40,903 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:03:40,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 05:03:41,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-14 05:03:41,105 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting dll_insert_masterErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 05:03:41,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:03:41,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1152447771, now seen corresponding path program 1 times [2022-12-14 05:03:41,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:03:41,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705288273] [2022-12-14 05:03:41,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:03:41,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:03:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:03:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 49 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:03:46,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:03:46,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705288273] [2022-12-14 05:03:46,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705288273] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:03:46,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461686507] [2022-12-14 05:03:46,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:03:46,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:03:46,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:03:46,192 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:03:46,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 05:03:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:03:46,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 88 conjunts are in the unsatisfiable core [2022-12-14 05:03:46,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:03:46,716 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 6 treesize of output 5 [2022-12-14 05:03:46,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 05:03:46,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 05:03:46,917 WARN L859 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_~#dll~0.base| Int)) (and (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|) (exists ((v_ArrVal_5262 Int)) (= |c_#length| (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_5262))) (exists ((v_ArrVal_5263 Int)) (= |c_#valid| (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_5263))))) is different from true [2022-12-14 05:03:49,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:49,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 05:03:49,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:49,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:49,679 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 05:03:49,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 05:03:50,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,145 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-14 05:03:50,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 22 [2022-12-14 05:03:50,384 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (v_ArrVal_5265 Int) (v_ArrVal_5264 Int) (v_ArrVal_5263 Int) (v_ArrVal_5262 Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_332| Int) (v_ArrVal_5273 Int) (v_ArrVal_5271 Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_333| Int) (v_ArrVal_5270 Int) (|dll_create_generic_~#dll~0.base| Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (let ((.cse1 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_5263))) (let ((.cse2 (store .cse1 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_332| 1))) (let ((.cse0 (store .cse2 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| 1))) (and (< |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|) (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_333|) 0) (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|) (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_332|) 0) (< |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_332| |c_#StackHeapBarrier|) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (store (store (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_5262) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_332| v_ArrVal_5265) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_5271) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_333| v_ArrVal_5273) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5270) |c_#length|) (= (select (store .cse0 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_333| v_ArrVal_5264) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (= (select .cse2 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 0) (< |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_333| |c_#StackHeapBarrier|)))))) is different from true [2022-12-14 05:03:50,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,663 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:03:50,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 40 [2022-12-14 05:03:50,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:03:50,715 INFO L321 Elim1Store]: treesize reduction 61, result has 24.7 percent of original size [2022-12-14 05:03:50,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 108 [2022-12-14 05:03:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 91 proven. 90 refuted. 0 times theorem prover too weak. 41 trivial. 9 not checked. [2022-12-14 05:03:50,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:03:53,677 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_388| Int)) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_388| |c_#StackHeapBarrier|)) (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_359| Int)) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_359| |c_#StackHeapBarrier|)) (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_358| Int)) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_358| |c_#StackHeapBarrier|)) (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389| Int)) (or (forall ((|v_dll_create_generic_~#dll~0.base_194| Int) (v_ArrVal_5337 Int) (v_ArrVal_5334 Int)) (let ((.cse0 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_194| v_ArrVal_5337))) (let ((.cse2 (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_359| 1))) (let ((.cse1 (store .cse2 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_358| 1))) (or (not (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_359|) 0)) (forall ((v_ArrVal_5338 Int) (v_ArrVal_5336 Int) (v_ArrVal_5335 Int) (v_ArrVal_5333 Int) (v_ArrVal_5332 Int)) (<= (+ |c_dll_insert_master_~item~1#1.offset| 12) (select (store (store (store (store (store |c_#length| |v_dll_create_generic_~#dll~0.base_194| v_ArrVal_5338) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_359| v_ArrVal_5332) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_358| v_ArrVal_5333) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389| v_ArrVal_5335) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_388| v_ArrVal_5336) |c_dll_insert_master_~item~1#1.base|))) (not (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389|) 0)) (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_194|)) (not (= (select .cse2 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_358|) 0)) (not (= (select (store .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389| v_ArrVal_5334) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_388|) 0))))))) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389| |c_#StackHeapBarrier|)))))))))) (or (forall ((|v_dll_create_generic_~#dll~0.base_194| Int) (v_ArrVal_5337 Int) (v_ArrVal_5334 Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_358| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_359| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_388| Int)) (let ((.cse3 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_194| v_ArrVal_5337))) (let ((.cse5 (store .cse3 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_359| 1))) (let ((.cse4 (store .cse5 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_358| 1))) (or (not (= (select .cse3 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_359|) 0)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389| |c_#StackHeapBarrier|)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_359| |c_#StackHeapBarrier|)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_388| |c_#StackHeapBarrier|)) (not (= (select .cse4 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389|) 0)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_358| |c_#StackHeapBarrier|)) (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_194|)) (not (= (select .cse5 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_358|) 0)) (not (= (select (store .cse4 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_389| v_ArrVal_5334) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_388|) 0))))))) (<= 0 (+ |c_dll_insert_master_~item~1#1.offset| 8)))) is different from false [2022-12-14 05:03:53,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461686507] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:03:53,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [748106797] [2022-12-14 05:03:53,683 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-12-14 05:03:53,683 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:03:53,683 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 05:03:53,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:03:53,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 19] total 46 [2022-12-14 05:03:53,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318179706] [2022-12-14 05:03:53,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:03:53,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-14 05:03:53,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:03:53,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-14 05:03:53,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1867, Unknown=7, NotChecked=270, Total=2352 [2022-12-14 05:03:53,685 INFO L87 Difference]: Start difference. First operand 272 states and 320 transitions. Second operand has 47 states, 41 states have (on average 3.3902439024390243) internal successors, (139), 42 states have internal predecessors, (139), 14 states have call successors, (19), 3 states have call predecessors, (19), 12 states have return successors, (20), 13 states have call predecessors, (20), 14 states have call successors, (20) [2022-12-14 05:03:56,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:00,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:02,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:04,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:08,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:10,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:12,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:14,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:18,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:23,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:27,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:31,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:33,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:35,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:39,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:42,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:44,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:48,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:52,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:55,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:04:57,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:05:11,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:05:11,891 INFO L93 Difference]: Finished difference Result 281 states and 331 transitions. [2022-12-14 05:05:11,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 05:05:11,891 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 41 states have (on average 3.3902439024390243) internal successors, (139), 42 states have internal predecessors, (139), 14 states have call successors, (19), 3 states have call predecessors, (19), 12 states have return successors, (20), 13 states have call predecessors, (20), 14 states have call successors, (20) Word has length 124 [2022-12-14 05:05:11,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:05:11,893 INFO L225 Difference]: With dead ends: 281 [2022-12-14 05:05:11,893 INFO L226 Difference]: Without dead ends: 281 [2022-12-14 05:05:11,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=540, Invalid=4709, Unknown=19, NotChecked=432, Total=5700 [2022-12-14 05:05:11,895 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 211 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 4221 mSolverCounterSat, 82 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 4871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 4221 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 528 IncrementalHoareTripleChecker+Unchecked, 48.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:05:11,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1748 Invalid, 4871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 4221 Invalid, 40 Unknown, 528 Unchecked, 48.1s Time] [2022-12-14 05:05:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-12-14 05:05:11,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 272. [2022-12-14 05:05:11,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 151 states have (on average 1.6821192052980132) internal successors, (254), 239 states have internal predecessors, (254), 32 states have call successors, (32), 11 states have call predecessors, (32), 17 states have return successors, (32), 24 states have call predecessors, (32), 18 states have call successors, (32) [2022-12-14 05:05:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 318 transitions. [2022-12-14 05:05:11,899 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 318 transitions. Word has length 124 [2022-12-14 05:05:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:05:11,899 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 318 transitions. [2022-12-14 05:05:11,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 41 states have (on average 3.3902439024390243) internal successors, (139), 42 states have internal predecessors, (139), 14 states have call successors, (19), 3 states have call predecessors, (19), 12 states have return successors, (20), 13 states have call predecessors, (20), 14 states have call successors, (20) [2022-12-14 05:05:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 318 transitions. [2022-12-14 05:05:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-14 05:05:11,900 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:05:11,900 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:05:11,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 05:05:12,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-14 05:05:12,102 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting dll_insert_masterErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 05:05:12,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:05:12,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1366161642, now seen corresponding path program 1 times [2022-12-14 05:05:12,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:05:12,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953597405] [2022-12-14 05:05:12,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:05:12,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:05:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:05:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 132 proven. 18 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-14 05:05:14,605 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:05:14,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953597405] [2022-12-14 05:05:14,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953597405] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:05:14,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855084543] [2022-12-14 05:05:14,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:05:14,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:05:14,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:05:14,606 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:05:14,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 05:05:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:05:14,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 05:05:14,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:05:14,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 05:05:15,014 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5868 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5868))))) is different from true [2022-12-14 05:05:19,098 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5869 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5869))))) is different from true [2022-12-14 05:05:27,838 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5870 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5870))))) is different from true [2022-12-14 05:05:39,994 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) is different from true [2022-12-14 05:05:56,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:05:56,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:05:56,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:05:56,504 INFO L321 Elim1Store]: treesize reduction 164, result has 28.1 percent of original size [2022-12-14 05:05:56,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 75 [2022-12-14 05:05:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 132 proven. 18 refuted. 0 times theorem prover too weak. 31 trivial. 51 not checked. [2022-12-14 05:05:56,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:05:56,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855084543] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:05:56,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [702587980] [2022-12-14 05:05:56,772 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-12-14 05:05:56,772 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:05:56,772 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 05:05:56,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:05:56,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 27 [2022-12-14 05:05:56,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55292836] [2022-12-14 05:05:56,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:05:56,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 05:05:56,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:05:56,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 05:05:56,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=501, Unknown=24, NotChecked=196, Total=812 [2022-12-14 05:05:56,774 INFO L87 Difference]: Start difference. First operand 272 states and 318 transitions. Second operand has 28 states, 23 states have (on average 4.608695652173913) internal successors, (106), 24 states have internal predecessors, (106), 12 states have call successors, (18), 4 states have call predecessors, (18), 8 states have return successors, (18), 13 states have call predecessors, (18), 11 states have call successors, (18) [2022-12-14 05:05:58,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:06:00,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:06:02,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:06:04,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:06:06,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:06:16,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:06:19,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:06:21,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:06:23,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:06:31,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:06:33,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:06:39,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:06:41,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:06:43,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:06:45,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:06:47,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:06:49,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:07:01,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:07:03,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:07:26,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:07:33,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:07:35,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:07:37,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:07:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:07:38,749 INFO L93 Difference]: Finished difference Result 286 states and 338 transitions. [2022-12-14 05:07:38,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 05:07:38,749 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 4.608695652173913) internal successors, (106), 24 states have internal predecessors, (106), 12 states have call successors, (18), 4 states have call predecessors, (18), 8 states have return successors, (18), 13 states have call predecessors, (18), 11 states have call successors, (18) Word has length 125 [2022-12-14 05:07:38,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:07:38,750 INFO L225 Difference]: With dead ends: 286 [2022-12-14 05:07:38,750 INFO L226 Difference]: Without dead ends: 286 [2022-12-14 05:07:38,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 137 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 93.4s TimeCoverageRelationStatistics Valid=242, Invalid=1624, Unknown=42, NotChecked=348, Total=2256 [2022-12-14 05:07:38,751 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 155 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 45 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 1030 IncrementalHoareTripleChecker+Unchecked, 50.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:07:38,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1422 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2109 Invalid, 24 Unknown, 1030 Unchecked, 50.5s Time] [2022-12-14 05:07:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-12-14 05:07:38,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 274. [2022-12-14 05:07:38,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 153 states have (on average 1.6862745098039216) internal successors, (258), 241 states have internal predecessors, (258), 32 states have call successors, (32), 11 states have call predecessors, (32), 17 states have return successors, (32), 24 states have call predecessors, (32), 18 states have call successors, (32) [2022-12-14 05:07:38,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 322 transitions. [2022-12-14 05:07:38,755 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 322 transitions. Word has length 125 [2022-12-14 05:07:38,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:07:38,755 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 322 transitions. [2022-12-14 05:07:38,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 4.608695652173913) internal successors, (106), 24 states have internal predecessors, (106), 12 states have call successors, (18), 4 states have call predecessors, (18), 8 states have return successors, (18), 13 states have call predecessors, (18), 11 states have call successors, (18) [2022-12-14 05:07:38,755 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 322 transitions. [2022-12-14 05:07:38,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-14 05:07:38,756 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:07:38,756 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:07:38,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-14 05:07:38,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-14 05:07:38,957 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting dll_insert_masterErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 05:07:38,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:07:38,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1366161643, now seen corresponding path program 1 times [2022-12-14 05:07:38,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:07:38,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53993598] [2022-12-14 05:07:38,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:07:38,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:07:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:07:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 05:07:44,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:07:44,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53993598] [2022-12-14 05:07:44,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53993598] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:07:44,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454680267] [2022-12-14 05:07:44,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:07:44,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:07:44,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:07:44,045 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:07:44,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 05:07:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:07:44,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 115 conjunts are in the unsatisfiable core [2022-12-14 05:07:44,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:07:44,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 05:07:44,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 05:07:44,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 05:07:45,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:07:45,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:45,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:45,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-12-14 05:07:45,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 05:07:45,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2022-12-14 05:07:46,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:46,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:46,044 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-12-14 05:07:46,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 46 [2022-12-14 05:07:46,052 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6450 Int)) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6450))))) is different from true [2022-12-14 05:07:46,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:46,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:46,525 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-12-14 05:07:46,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 34 [2022-12-14 05:07:46,533 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6451 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6451) |c_#length|)))) is different from true [2022-12-14 05:07:50,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:50,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:50,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:50,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:50,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:50,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:50,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:50,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:50,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:50,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:51,027 INFO L321 Elim1Store]: treesize reduction 56, result has 37.8 percent of original size [2022-12-14 05:07:51,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 54 [2022-12-14 05:07:51,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:51,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:51,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:07:51,058 INFO L321 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2022-12-14 05:07:51,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 58 [2022-12-14 05:07:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 132 proven. 38 refuted. 0 times theorem prover too weak. 19 trivial. 43 not checked. [2022-12-14 05:07:51,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:08:00,173 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:08:00,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454680267] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:08:00,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1051835859] [2022-12-14 05:08:00,176 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-12-14 05:08:00,176 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:08:00,176 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 05:08:00,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:08:00,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 30] total 60 [2022-12-14 05:08:00,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280776301] [2022-12-14 05:08:00,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:08:00,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-12-14 05:08:00,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:08:00,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-12-14 05:08:00,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=3239, Unknown=13, NotChecked=234, Total=3782 [2022-12-14 05:08:00,179 INFO L87 Difference]: Start difference. First operand 274 states and 322 transitions. Second operand has 61 states, 54 states have (on average 2.740740740740741) internal successors, (148), 54 states have internal predecessors, (148), 17 states have call successors, (24), 8 states have call predecessors, (24), 11 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2022-12-14 05:08:33,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:08:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:08:38,764 INFO L93 Difference]: Finished difference Result 283 states and 332 transitions. [2022-12-14 05:08:38,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 05:08:38,764 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 54 states have (on average 2.740740740740741) internal successors, (148), 54 states have internal predecessors, (148), 17 states have call successors, (24), 8 states have call predecessors, (24), 11 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) Word has length 125 [2022-12-14 05:08:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:08:38,765 INFO L225 Difference]: With dead ends: 283 [2022-12-14 05:08:38,765 INFO L226 Difference]: Without dead ends: 283 [2022-12-14 05:08:38,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 42.7s TimeCoverageRelationStatistics Valid=723, Invalid=6746, Unknown=21, NotChecked=342, Total=7832 [2022-12-14 05:08:38,766 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 519 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 197 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 4229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 486 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:08:38,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1370 Invalid, 4229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 3531 Invalid, 15 Unknown, 486 Unchecked, 11.5s Time] [2022-12-14 05:08:38,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-12-14 05:08:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 266. [2022-12-14 05:08:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 236 states have internal predecessors, (250), 32 states have call successors, (32), 11 states have call predecessors, (32), 15 states have return successors, (28), 21 states have call predecessors, (28), 18 states have call successors, (28) [2022-12-14 05:08:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 310 transitions. [2022-12-14 05:08:38,770 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 310 transitions. Word has length 125 [2022-12-14 05:08:38,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:08:38,770 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 310 transitions. [2022-12-14 05:08:38,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 54 states have (on average 2.740740740740741) internal successors, (148), 54 states have internal predecessors, (148), 17 states have call successors, (24), 8 states have call predecessors, (24), 11 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2022-12-14 05:08:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 310 transitions. [2022-12-14 05:08:38,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-14 05:08:38,771 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:08:38,771 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:08:38,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 05:08:38,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-14 05:08:38,972 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 05:08:38,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:08:38,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1734084164, now seen corresponding path program 1 times [2022-12-14 05:08:38,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:08:38,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078790633] [2022-12-14 05:08:38,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:08:38,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:08:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:08:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-12-14 05:08:39,432 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:08:39,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078790633] [2022-12-14 05:08:39,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078790633] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:08:39,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733419177] [2022-12-14 05:08:39,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:08:39,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:08:39,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:08:39,434 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:08:39,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 05:08:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:08:39,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 1297 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 05:08:39,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:08:39,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:08:39,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-12-14 05:08:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 05:08:39,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:08:40,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-12-14 05:08:40,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-12-14 05:08:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-12-14 05:08:40,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733419177] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:08:40,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1525401598] [2022-12-14 05:08:40,233 INFO L159 IcfgInterpreter]: Started Sifa with 43 locations of interest [2022-12-14 05:08:40,233 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:08:40,233 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 05:08:40,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:08:40,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 15 [2022-12-14 05:08:40,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440354056] [2022-12-14 05:08:40,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:08:40,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 05:08:40,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:08:40,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 05:08:40,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-12-14 05:08:40,235 INFO L87 Difference]: Start difference. First operand 266 states and 310 transitions. Second operand has 15 states, 11 states have (on average 4.636363636363637) internal successors, (51), 13 states have internal predecessors, (51), 6 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2022-12-14 05:08:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:08:40,828 INFO L93 Difference]: Finished difference Result 366 states and 422 transitions. [2022-12-14 05:08:40,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 05:08:40,828 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 4.636363636363637) internal successors, (51), 13 states have internal predecessors, (51), 6 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 123 [2022-12-14 05:08:40,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:08:40,829 INFO L225 Difference]: With dead ends: 366 [2022-12-14 05:08:40,829 INFO L226 Difference]: Without dead ends: 366 [2022-12-14 05:08:40,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-12-14 05:08:40,830 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 153 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:08:40,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 2134 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 05:08:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-12-14 05:08:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 291. [2022-12-14 05:08:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 171 states have (on average 1.7426900584795322) internal successors, (298), 259 states have internal predecessors, (298), 32 states have call successors, (32), 12 states have call predecessors, (32), 16 states have return successors, (28), 21 states have call predecessors, (28), 18 states have call successors, (28) [2022-12-14 05:08:40,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 358 transitions. [2022-12-14 05:08:40,833 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 358 transitions. Word has length 123 [2022-12-14 05:08:40,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:08:40,833 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 358 transitions. [2022-12-14 05:08:40,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 4.636363636363637) internal successors, (51), 13 states have internal predecessors, (51), 6 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2022-12-14 05:08:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 358 transitions. [2022-12-14 05:08:40,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-14 05:08:40,834 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:08:40,834 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:08:40,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-14 05:08:41,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:08:41,035 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting inspect_baseErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 05:08:41,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:08:41,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1734072546, now seen corresponding path program 1 times [2022-12-14 05:08:41,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:08:41,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538036907] [2022-12-14 05:08:41,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:08:41,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:08:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:08:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-12-14 05:08:41,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:08:41,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538036907] [2022-12-14 05:08:41,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538036907] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:08:41,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284343905] [2022-12-14 05:08:41,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:08:41,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:08:41,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:08:41,816 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:08:41,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 05:08:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:08:42,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 05:08:42,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:08:42,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:08:42,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:08:42,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:08:42,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-12-14 05:08:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 05:08:42,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:08:42,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-14 05:08:43,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2022-12-14 05:08:43,027 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 05:08:43,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 58 [2022-12-14 05:08:43,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-12-14 05:08:43,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-12-14 05:08:43,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-14 05:08:43,382 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-12-14 05:08:43,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284343905] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:08:43,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [129041230] [2022-12-14 05:08:43,383 INFO L159 IcfgInterpreter]: Started Sifa with 43 locations of interest [2022-12-14 05:08:43,383 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:08:43,384 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 05:08:43,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:08:43,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 35 [2022-12-14 05:08:43,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101263290] [2022-12-14 05:08:43,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:08:43,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 05:08:43,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:08:43,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 05:08:43,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1165, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 05:08:43,386 INFO L87 Difference]: Start difference. First operand 291 states and 358 transitions. Second operand has 36 states, 25 states have (on average 3.56) internal successors, (89), 32 states have internal predecessors, (89), 13 states have call successors, (21), 3 states have call predecessors, (21), 11 states have return successors, (22), 15 states have call predecessors, (22), 12 states have call successors, (22) [2022-12-14 05:08:45,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:08:45,629 INFO L93 Difference]: Finished difference Result 304 states and 353 transitions. [2022-12-14 05:08:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 05:08:45,629 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 25 states have (on average 3.56) internal successors, (89), 32 states have internal predecessors, (89), 13 states have call successors, (21), 3 states have call predecessors, (21), 11 states have return successors, (22), 15 states have call predecessors, (22), 12 states have call successors, (22) Word has length 123 [2022-12-14 05:08:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:08:45,631 INFO L225 Difference]: With dead ends: 304 [2022-12-14 05:08:45,631 INFO L226 Difference]: Without dead ends: 304 [2022-12-14 05:08:45,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=292, Invalid=2900, Unknown=0, NotChecked=0, Total=3192 [2022-12-14 05:08:45,632 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 361 mSDsluCounter, 2034 mSDsCounter, 0 mSdLazyCounter, 3973 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 2154 SdHoareTripleChecker+Invalid, 4057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 3973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:08:45,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 2154 Invalid, 4057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 3973 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-14 05:08:45,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-12-14 05:08:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 286. [2022-12-14 05:08:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 172 states have (on average 1.6744186046511629) internal successors, (288), 254 states have internal predecessors, (288), 32 states have call successors, (32), 12 states have call predecessors, (32), 16 states have return successors, (28), 21 states have call predecessors, (28), 18 states have call successors, (28) [2022-12-14 05:08:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 348 transitions. [2022-12-14 05:08:45,636 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 348 transitions. Word has length 123 [2022-12-14 05:08:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:08:45,636 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 348 transitions. [2022-12-14 05:08:45,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 25 states have (on average 3.56) internal successors, (89), 32 states have internal predecessors, (89), 13 states have call successors, (21), 3 states have call predecessors, (21), 11 states have return successors, (22), 15 states have call predecessors, (22), 12 states have call successors, (22) [2022-12-14 05:08:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 348 transitions. [2022-12-14 05:08:45,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 05:08:45,637 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:08:45,637 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:08:45,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-14 05:08:45,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:08:45,838 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting inspect_baseErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 05:08:45,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:08:45,839 INFO L85 PathProgramCache]: Analyzing trace with hash -292710233, now seen corresponding path program 1 times [2022-12-14 05:08:45,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:08:45,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328814890] [2022-12-14 05:08:45,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:08:45,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:08:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:08:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-12-14 05:08:46,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:08:46,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328814890] [2022-12-14 05:08:46,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328814890] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:08:46,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301850189] [2022-12-14 05:08:46,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:08:46,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:08:46,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:08:46,565 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:08:46,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 05:08:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:08:46,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-14 05:08:46,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:08:47,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:08:47,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:08:47,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 05:08:47,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-14 05:08:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 33 proven. 5 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-12-14 05:08:47,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:08:47,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2022-12-14 05:08:47,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 100 [2022-12-14 05:08:47,812 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:08:47,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 95 [2022-12-14 05:08:47,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-12-14 05:08:47,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:08:47,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:08:47,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:08:47,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:08:47,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-12-14 05:08:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-12-14 05:08:48,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301850189] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:08:48,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [276563100] [2022-12-14 05:08:48,062 INFO L159 IcfgInterpreter]: Started Sifa with 42 locations of interest [2022-12-14 05:08:48,062 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:08:48,063 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 05:08:48,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:08:48,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 27 [2022-12-14 05:08:48,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113181002] [2022-12-14 05:08:48,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:08:48,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 05:08:48,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:08:48,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 05:08:48,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-12-14 05:08:48,065 INFO L87 Difference]: Start difference. First operand 286 states and 348 transitions. Second operand has 28 states, 20 states have (on average 3.45) internal successors, (69), 24 states have internal predecessors, (69), 7 states have call successors, (13), 3 states have call predecessors, (13), 7 states have return successors, (15), 11 states have call predecessors, (15), 5 states have call successors, (15) [2022-12-14 05:08:49,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:08:49,235 INFO L93 Difference]: Finished difference Result 346 states and 402 transitions. [2022-12-14 05:08:49,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 05:08:49,235 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 20 states have (on average 3.45) internal successors, (69), 24 states have internal predecessors, (69), 7 states have call successors, (13), 3 states have call predecessors, (13), 7 states have return successors, (15), 11 states have call predecessors, (15), 5 states have call successors, (15) Word has length 109 [2022-12-14 05:08:49,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:08:49,236 INFO L225 Difference]: With dead ends: 346 [2022-12-14 05:08:49,236 INFO L226 Difference]: Without dead ends: 346 [2022-12-14 05:08:49,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 05:08:49,237 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 184 mSDsluCounter, 2045 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:08:49,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 2200 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 05:08:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-12-14 05:08:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 308. [2022-12-14 05:08:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 195 states have (on average 1.6974358974358974) internal successors, (331), 276 states have internal predecessors, (331), 32 states have call successors, (32), 12 states have call predecessors, (32), 16 states have return successors, (28), 21 states have call predecessors, (28), 18 states have call successors, (28) [2022-12-14 05:08:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 391 transitions. [2022-12-14 05:08:49,240 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 391 transitions. Word has length 109 [2022-12-14 05:08:49,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:08:49,240 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 391 transitions. [2022-12-14 05:08:49,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 20 states have (on average 3.45) internal successors, (69), 24 states have internal predecessors, (69), 7 states have call successors, (13), 3 states have call predecessors, (13), 7 states have return successors, (15), 11 states have call predecessors, (15), 5 states have call successors, (15) [2022-12-14 05:08:49,240 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 391 transitions. [2022-12-14 05:08:49,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-14 05:08:49,241 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:08:49,241 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:08:49,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-14 05:08:49,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-14 05:08:49,443 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 05:08:49,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:08:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1346844812, now seen corresponding path program 1 times [2022-12-14 05:08:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:08:49,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208078653] [2022-12-14 05:08:49,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:08:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:08:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:08:50,690 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 29 proven. 25 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-14 05:08:50,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:08:50,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208078653] [2022-12-14 05:08:50,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208078653] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:08:50,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684056690] [2022-12-14 05:08:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:08:50,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:08:50,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:08:50,691 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:08:50,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 05:08:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:08:51,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-14 05:08:51,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:08:51,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:08:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 29 proven. 27 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-12-14 05:08:51,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:08:51,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684056690] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:08:51,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1742353438] [2022-12-14 05:08:51,983 INFO L159 IcfgInterpreter]: Started Sifa with 45 locations of interest [2022-12-14 05:08:51,983 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:08:51,983 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-12-14 05:08:51,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:08:51,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 36 [2022-12-14 05:08:51,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126361271] [2022-12-14 05:08:51,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:08:51,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 05:08:51,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:08:51,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 05:08:51,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1233, Unknown=6, NotChecked=0, Total=1332 [2022-12-14 05:08:51,985 INFO L87 Difference]: Start difference. First operand 308 states and 391 transitions. Second operand has 36 states, 28 states have (on average 2.642857142857143) internal successors, (74), 30 states have internal predecessors, (74), 12 states have call successors, (16), 5 states have call predecessors, (16), 11 states have return successors, (16), 13 states have call predecessors, (16), 10 states have call successors, (16) [2022-12-14 05:08:54,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:09:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:09:10,580 INFO L93 Difference]: Finished difference Result 312 states and 390 transitions. [2022-12-14 05:09:10,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 05:09:10,580 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 2.642857142857143) internal successors, (74), 30 states have internal predecessors, (74), 12 states have call successors, (16), 5 states have call predecessors, (16), 11 states have return successors, (16), 13 states have call predecessors, (16), 10 states have call successors, (16) Word has length 112 [2022-12-14 05:09:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:09:10,581 INFO L225 Difference]: With dead ends: 312 [2022-12-14 05:09:10,581 INFO L226 Difference]: Without dead ends: 312 [2022-12-14 05:09:10,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=243, Invalid=2704, Unknown=23, NotChecked=0, Total=2970 [2022-12-14 05:09:10,582 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 169 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 3662 mSolverCounterSat, 65 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 2869 SdHoareTripleChecker+Invalid, 3752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3662 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:09:10,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 2869 Invalid, 3752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3662 Invalid, 25 Unknown, 0 Unchecked, 3.6s Time] [2022-12-14 05:09:10,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-12-14 05:09:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 301. [2022-12-14 05:09:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 191 states have (on average 1.712041884816754) internal successors, (327), 271 states have internal predecessors, (327), 32 states have call successors, (32), 12 states have call predecessors, (32), 13 states have return successors, (21), 19 states have call predecessors, (21), 18 states have call successors, (21) [2022-12-14 05:09:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 380 transitions. [2022-12-14 05:09:10,586 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 380 transitions. Word has length 112 [2022-12-14 05:09:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:09:10,586 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 380 transitions. [2022-12-14 05:09:10,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 2.642857142857143) internal successors, (74), 30 states have internal predecessors, (74), 12 states have call successors, (16), 5 states have call predecessors, (16), 11 states have return successors, (16), 13 states have call predecessors, (16), 10 states have call successors, (16) [2022-12-14 05:09:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 380 transitions. [2022-12-14 05:09:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 05:09:10,587 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:09:10,587 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:09:10,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-14 05:09:10,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41369cc0-8987-49b5-b64b-fbcea13bfd20/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-14 05:09:10,789 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-12-14 05:09:10,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:09:10,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1195740055, now seen corresponding path program 1 times [2022-12-14 05:09:10,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:09:10,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917324814] [2022-12-14 05:09:10,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:09:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:09:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat