./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/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_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 --- 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 08:59:46,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 08:59:46,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 08:59:46,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 08:59:46,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 08:59:46,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 08:59:46,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 08:59:46,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 08:59:46,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 08:59:46,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 08:59:46,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 08:59:46,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 08:59:46,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 08:59:46,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 08:59:46,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 08:59:46,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 08:59:46,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 08:59:46,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 08:59:46,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 08:59:46,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 08:59:46,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 08:59:46,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 08:59:46,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 08:59:46,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 08:59:46,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 08:59:46,459 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 08:59:46,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 08:59:46,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 08:59:46,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 08:59:46,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 08:59:46,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 08:59:46,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 08:59:46,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 08:59:46,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 08:59:46,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 08:59:46,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 08:59:46,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 08:59:46,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 08:59:46,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 08:59:46,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 08:59:46,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 08:59:46,466 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 08:59:46,490 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 08:59:46,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 08:59:46,490 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 08:59:46,490 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 08:59:46,491 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 08:59:46,491 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 08:59:46,491 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 08:59:46,492 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 08:59:46,492 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 08:59:46,492 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 08:59:46,492 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 08:59:46,492 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 08:59:46,492 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 08:59:46,492 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 08:59:46,492 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 08:59:46,493 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 08:59:46,493 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 08:59:46,493 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 08:59:46,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 08:59:46,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 08:59:46,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 08:59:46,494 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 08:59:46,494 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 08:59:46,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 08:59:46,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 08:59:46,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 08:59:46,494 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 08:59:46,495 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 08:59:46,495 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 08:59:46,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 08:59:46,495 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 08:59:46,495 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 08:59:46,495 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 08:59:46,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 08:59:46,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 08:59:46,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:59:46,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 08:59:46,496 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 08:59:46,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 08:59:46,496 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 08:59:46,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 08:59:46,496 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 08:59:46,497 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_d40c1d50-3600-45a9-a7fc-56e66b9044ff/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_d40c1d50-3600-45a9-a7fc-56e66b9044ff/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 [2022-12-14 08:59:46,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 08:59:46,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 08:59:46,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 08:59:46,713 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 08:59:46,714 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 08:59:46,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2022-12-14 08:59:49,219 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 08:59:49,412 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 08:59:49,413 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2022-12-14 08:59:49,422 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/data/31db7a2d4/ad013bca13554e6a9624e1f04637fdf2/FLAGbd0517947 [2022-12-14 08:59:49,787 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/data/31db7a2d4/ad013bca13554e6a9624e1f04637fdf2 [2022-12-14 08:59:49,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 08:59:49,791 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 08:59:49,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 08:59:49,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 08:59:49,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 08:59:49,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:59:49" (1/1) ... [2022-12-14 08:59:49,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@224e41c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:49, skipping insertion in model container [2022-12-14 08:59:49,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:59:49" (1/1) ... [2022-12-14 08:59:49,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 08:59:49,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 08:59:50,012 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_d40c1d50-3600-45a9-a7fc-56e66b9044ff/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i[22634,22647] [2022-12-14 08:59:50,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:59:50,048 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 08:59:50,066 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_d40c1d50-3600-45a9-a7fc-56e66b9044ff/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i[22634,22647] [2022-12-14 08:59:50,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:59:50,097 INFO L208 MainTranslator]: Completed translation [2022-12-14 08:59:50,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:50 WrapperNode [2022-12-14 08:59:50,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 08:59:50,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 08:59:50,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 08:59:50,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 08:59:50,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:50" (1/1) ... [2022-12-14 08:59:50,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:50" (1/1) ... [2022-12-14 08:59:50,133 INFO L138 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 234 [2022-12-14 08:59:50,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 08:59:50,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 08:59:50,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 08:59:50,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 08:59:50,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:50" (1/1) ... [2022-12-14 08:59:50,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:50" (1/1) ... [2022-12-14 08:59:50,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:50" (1/1) ... [2022-12-14 08:59:50,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:50" (1/1) ... [2022-12-14 08:59:50,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:50" (1/1) ... [2022-12-14 08:59:50,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:50" (1/1) ... [2022-12-14 08:59:50,159 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:50" (1/1) ... [2022-12-14 08:59:50,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:50" (1/1) ... [2022-12-14 08:59:50,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 08:59:50,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 08:59:50,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 08:59:50,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 08:59:50,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:50" (1/1) ... [2022-12-14 08:59:50,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:59:50,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:59:50,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 08:59:50,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 08:59:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-12-14 08:59:50,224 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-12-14 08:59:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2022-12-14 08:59:50,224 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2022-12-14 08:59:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 08:59:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 08:59:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2022-12-14 08:59:50,225 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2022-12-14 08:59:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 08:59:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 08:59:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-12-14 08:59:50,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-12-14 08:59:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 08:59:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 08:59:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 08:59:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2022-12-14 08:59:50,226 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2022-12-14 08:59:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2022-12-14 08:59:50,227 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2022-12-14 08:59:50,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 08:59:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 08:59:50,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 08:59:50,345 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 08:59:50,347 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 08:59:50,839 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 08:59:50,885 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 08:59:50,886 INFO L300 CfgBuilder]: Removed 38 assume(true) statements. [2022-12-14 08:59:50,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:59:50 BoogieIcfgContainer [2022-12-14 08:59:50,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 08:59:50,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 08:59:50,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 08:59:50,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 08:59:50,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 08:59:49" (1/3) ... [2022-12-14 08:59:50,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53479444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:59:50, skipping insertion in model container [2022-12-14 08:59:50,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:50" (2/3) ... [2022-12-14 08:59:50,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53479444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:59:50, skipping insertion in model container [2022-12-14 08:59:50,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:59:50" (3/3) ... [2022-12-14 08:59:50,895 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-1.i [2022-12-14 08:59:50,909 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 08:59:50,909 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2022-12-14 08:59:50,951 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 08:59:50,957 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;@60fbf78d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 08:59:50,957 INFO L358 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2022-12-14 08:59:50,961 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 08:59:50,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 08:59:50,968 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:50,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:50,969 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 08:59:50,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:50,974 INFO L85 PathProgramCache]: Analyzing trace with hash -195677477, now seen corresponding path program 1 times [2022-12-14 08:59:50,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:50,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936999033] [2022-12-14 08:59:50,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:50,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:51,196 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 08:59:51,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:51,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936999033] [2022-12-14 08:59:51,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936999033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:51,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:51,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 08:59:51,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314908632] [2022-12-14 08:59:51,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:51,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:59:51,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:51,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:59:51,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:59:51,229 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 08:59:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:51,434 INFO L93 Difference]: Finished difference Result 231 states and 263 transitions. [2022-12-14 08:59:51,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:59:51,437 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 08:59:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:51,443 INFO L225 Difference]: With dead ends: 231 [2022-12-14 08:59:51,444 INFO L226 Difference]: Without dead ends: 230 [2022-12-14 08:59:51,445 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 08:59:51,447 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.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:59:51,447 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.2s Time] [2022-12-14 08:59:51,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-12-14 08:59:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2022-12-14 08:59:51,484 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 08:59:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 258 transitions. [2022-12-14 08:59:51,488 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 258 transitions. Word has length 7 [2022-12-14 08:59:51,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:51,489 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 258 transitions. [2022-12-14 08:59:51,489 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 08:59:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 258 transitions. [2022-12-14 08:59:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 08:59:51,489 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:51,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:51,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 08:59:51,490 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 08:59:51,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:51,491 INFO L85 PathProgramCache]: Analyzing trace with hash -195677476, now seen corresponding path program 1 times [2022-12-14 08:59:51,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:51,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48964700] [2022-12-14 08:59:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:51,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:51,579 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 08:59:51,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:51,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48964700] [2022-12-14 08:59:51,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48964700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:51,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:51,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 08:59:51,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110431644] [2022-12-14 08:59:51,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:51,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:59:51,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:51,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:59:51,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:59:51,582 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 08:59:51,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:51,730 INFO L93 Difference]: Finished difference Result 228 states and 260 transitions. [2022-12-14 08:59:51,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:59:51,730 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 08:59:51,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:51,731 INFO L225 Difference]: With dead ends: 228 [2022-12-14 08:59:51,731 INFO L226 Difference]: Without dead ends: 228 [2022-12-14 08:59:51,732 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 08:59:51,733 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 08:59:51,733 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 08:59:51,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-12-14 08:59:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2022-12-14 08:59:51,741 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 08:59:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 256 transitions. [2022-12-14 08:59:51,742 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 256 transitions. Word has length 7 [2022-12-14 08:59:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:51,742 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 256 transitions. [2022-12-14 08:59:51,743 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 08:59:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 256 transitions. [2022-12-14 08:59:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 08:59:51,743 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:51,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:51,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 08:59:51,744 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 08:59:51,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:51,744 INFO L85 PathProgramCache]: Analyzing trace with hash 915293198, now seen corresponding path program 1 times [2022-12-14 08:59:51,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:51,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730376674] [2022-12-14 08:59:51,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:51,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:51,796 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 08:59:51,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:51,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730376674] [2022-12-14 08:59:51,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730376674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:51,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:51,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 08:59:51,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807980834] [2022-12-14 08:59:51,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:51,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:59:51,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:51,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:59:51,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:59:51,799 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 08:59:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:51,916 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2022-12-14 08:59:51,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:59:51,917 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 08:59:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:51,919 INFO L225 Difference]: With dead ends: 223 [2022-12-14 08:59:51,919 INFO L226 Difference]: Without dead ends: 223 [2022-12-14 08:59:51,919 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 08:59:51,921 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 08:59:51,921 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 08:59:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-12-14 08:59:51,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2022-12-14 08:59:51,934 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 08:59:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2022-12-14 08:59:51,937 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 9 [2022-12-14 08:59:51,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:51,937 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2022-12-14 08:59:51,937 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 08:59:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2022-12-14 08:59:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 08:59:51,938 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:51,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:51,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 08:59:51,938 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 08:59:51,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:51,939 INFO L85 PathProgramCache]: Analyzing trace with hash 915293199, now seen corresponding path program 1 times [2022-12-14 08:59:51,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:51,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032365099] [2022-12-14 08:59:51,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:51,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:52,012 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 08:59:52,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:52,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032365099] [2022-12-14 08:59:52,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032365099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:52,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:52,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 08:59:52,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263737243] [2022-12-14 08:59:52,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:52,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:59:52,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:52,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:59:52,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:59:52,014 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 08:59:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:52,131 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2022-12-14 08:59:52,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:59:52,131 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 08:59:52,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:52,132 INFO L225 Difference]: With dead ends: 220 [2022-12-14 08:59:52,132 INFO L226 Difference]: Without dead ends: 220 [2022-12-14 08:59:52,132 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 08:59:52,133 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 08:59:52,134 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 08:59:52,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-12-14 08:59:52,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-12-14 08:59:52,141 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 08:59:52,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 250 transitions. [2022-12-14 08:59:52,142 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 250 transitions. Word has length 9 [2022-12-14 08:59:52,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:52,143 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 250 transitions. [2022-12-14 08:59:52,143 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 08:59:52,143 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 250 transitions. [2022-12-14 08:59:52,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 08:59:52,143 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:52,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:52,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 08:59:52,144 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 08:59:52,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:52,145 INFO L85 PathProgramCache]: Analyzing trace with hash 932524912, now seen corresponding path program 1 times [2022-12-14 08:59:52,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:52,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114430554] [2022-12-14 08:59:52,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:52,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:52,273 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 08:59:52,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:52,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114430554] [2022-12-14 08:59:52,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114430554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:52,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:52,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 08:59:52,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008179277] [2022-12-14 08:59:52,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:52,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:59:52,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:52,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:59:52,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:59:52,276 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 08:59:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:52,431 INFO L93 Difference]: Finished difference Result 242 states and 280 transitions. [2022-12-14 08:59:52,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 08:59:52,431 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 08:59:52,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:52,433 INFO L225 Difference]: With dead ends: 242 [2022-12-14 08:59:52,433 INFO L226 Difference]: Without dead ends: 242 [2022-12-14 08:59:52,433 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 08:59:52,434 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 08:59:52,435 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 08:59:52,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-12-14 08:59:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236. [2022-12-14 08:59:52,443 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 08:59:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 276 transitions. [2022-12-14 08:59:52,445 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 276 transitions. Word has length 9 [2022-12-14 08:59:52,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:52,445 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 276 transitions. [2022-12-14 08:59:52,445 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 08:59:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 276 transitions. [2022-12-14 08:59:52,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 08:59:52,446 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:52,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:52,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 08:59:52,446 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 08:59:52,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:52,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1247697935, now seen corresponding path program 1 times [2022-12-14 08:59:52,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:52,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487740048] [2022-12-14 08:59:52,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:52,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:52,619 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 08:59:52,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:52,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487740048] [2022-12-14 08:59:52,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487740048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:52,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:52,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 08:59:52,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471309784] [2022-12-14 08:59:52,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:52,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 08:59:52,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:52,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 08:59:52,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 08:59:52,622 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 08:59:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:52,930 INFO L93 Difference]: Finished difference Result 255 states and 298 transitions. [2022-12-14 08:59:52,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 08:59:52,930 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 08:59:52,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:52,931 INFO L225 Difference]: With dead ends: 255 [2022-12-14 08:59:52,931 INFO L226 Difference]: Without dead ends: 255 [2022-12-14 08:59:52,932 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 08:59:52,932 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 08:59:52,932 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 08:59:52,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-12-14 08:59:52,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 245. [2022-12-14 08:59:52,937 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 08:59:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 288 transitions. [2022-12-14 08:59:52,938 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 288 transitions. Word has length 12 [2022-12-14 08:59:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:52,938 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 288 transitions. [2022-12-14 08:59:52,938 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 08:59:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 288 transitions. [2022-12-14 08:59:52,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 08:59:52,938 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:52,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:52,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 08:59:52,939 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 08:59:52,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:52,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1247697934, now seen corresponding path program 1 times [2022-12-14 08:59:52,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:52,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534316569] [2022-12-14 08:59:52,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:52,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:53,108 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 08:59:53,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:53,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534316569] [2022-12-14 08:59:53,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534316569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:53,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:53,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 08:59:53,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741482569] [2022-12-14 08:59:53,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:53,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 08:59:53,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:53,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 08:59:53,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:59:53,110 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 08:59:53,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:53,562 INFO L93 Difference]: Finished difference Result 253 states and 296 transitions. [2022-12-14 08:59:53,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 08:59:53,563 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 08:59:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:53,564 INFO L225 Difference]: With dead ends: 253 [2022-12-14 08:59:53,564 INFO L226 Difference]: Without dead ends: 253 [2022-12-14 08:59:53,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-14 08:59:53,564 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 08:59:53,565 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 08:59:53,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-12-14 08:59:53,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 245. [2022-12-14 08:59:53,569 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 08:59:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 286 transitions. [2022-12-14 08:59:53,570 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 286 transitions. Word has length 12 [2022-12-14 08:59:53,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:53,571 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 286 transitions. [2022-12-14 08:59:53,571 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 08:59:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 286 transitions. [2022-12-14 08:59:53,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 08:59:53,571 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:53,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:53,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 08:59:53,572 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 08:59:53,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:53,572 INFO L85 PathProgramCache]: Analyzing trace with hash -23910485, now seen corresponding path program 1 times [2022-12-14 08:59:53,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:53,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911519427] [2022-12-14 08:59:53,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:53,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:53,611 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 08:59:53,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:53,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911519427] [2022-12-14 08:59:53,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911519427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:53,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:53,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:59:53,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072525565] [2022-12-14 08:59:53,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:53,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:59:53,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:53,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:59:53,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:59:53,613 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 08:59:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:53,761 INFO L93 Difference]: Finished difference Result 244 states and 285 transitions. [2022-12-14 08:59:53,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:59:53,762 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 08:59:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:53,764 INFO L225 Difference]: With dead ends: 244 [2022-12-14 08:59:53,764 INFO L226 Difference]: Without dead ends: 244 [2022-12-14 08:59:53,764 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 08:59:53,765 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 08:59:53,765 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 08:59:53,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-12-14 08:59:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-12-14 08:59:53,770 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 08:59:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 285 transitions. [2022-12-14 08:59:53,771 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 285 transitions. Word has length 13 [2022-12-14 08:59:53,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:53,772 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 285 transitions. [2022-12-14 08:59:53,772 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 08:59:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 285 transitions. [2022-12-14 08:59:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 08:59:53,772 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:53,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:53,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 08:59:53,773 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 08:59:53,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:53,773 INFO L85 PathProgramCache]: Analyzing trace with hash -23910484, now seen corresponding path program 1 times [2022-12-14 08:59:53,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:53,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459505579] [2022-12-14 08:59:53,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:53,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:59:53,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:53,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459505579] [2022-12-14 08:59:53,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459505579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:53,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:53,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:59:53,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057407785] [2022-12-14 08:59:53,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:53,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:59:53,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:53,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:59:53,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:59:53,845 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 08:59:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:53,981 INFO L93 Difference]: Finished difference Result 243 states and 284 transitions. [2022-12-14 08:59:53,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:59:53,981 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 08:59:53,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:53,983 INFO L225 Difference]: With dead ends: 243 [2022-12-14 08:59:53,983 INFO L226 Difference]: Without dead ends: 243 [2022-12-14 08:59:53,984 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 08:59:53,984 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 08:59:53,984 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 08:59:53,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-12-14 08:59:53,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2022-12-14 08:59:53,990 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 08:59:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 284 transitions. [2022-12-14 08:59:53,991 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 284 transitions. Word has length 13 [2022-12-14 08:59:53,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:53,991 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 284 transitions. [2022-12-14 08:59:53,991 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 08:59:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 284 transitions. [2022-12-14 08:59:53,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 08:59:53,991 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:53,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:53,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 08:59:53,992 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 08:59:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1503139572, now seen corresponding path program 1 times [2022-12-14 08:59:53,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:53,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502269645] [2022-12-14 08:59:53,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:54,235 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 08:59:54,236 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:54,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502269645] [2022-12-14 08:59:54,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502269645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:54,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:54,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 08:59:54,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749629342] [2022-12-14 08:59:54,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:54,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 08:59:54,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:54,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 08:59:54,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-14 08:59:54,237 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 08:59:54,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:54,645 INFO L93 Difference]: Finished difference Result 270 states and 316 transitions. [2022-12-14 08:59:54,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 08:59:54,646 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 08:59:54,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:54,647 INFO L225 Difference]: With dead ends: 270 [2022-12-14 08:59:54,647 INFO L226 Difference]: Without dead ends: 270 [2022-12-14 08:59:54,647 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 08:59:54,648 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.4s IncrementalHoareTripleChecker+Time [2022-12-14 08:59:54,648 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.4s Time] [2022-12-14 08:59:54,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-12-14 08:59:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 257. [2022-12-14 08:59:54,655 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 08:59:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2022-12-14 08:59:54,657 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 15 [2022-12-14 08:59:54,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:54,657 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2022-12-14 08:59:54,657 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 08:59:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2022-12-14 08:59:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 08:59:54,658 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:54,658 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 08:59:54,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 08:59:54,658 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 08:59:54,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:54,659 INFO L85 PathProgramCache]: Analyzing trace with hash 818836412, now seen corresponding path program 1 times [2022-12-14 08:59:54,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:54,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103900062] [2022-12-14 08:59:54,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:54,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:54,841 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 08:59:54,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:54,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103900062] [2022-12-14 08:59:54,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103900062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:54,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:54,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 08:59:54,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117184766] [2022-12-14 08:59:54,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:54,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:59:54,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:54,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:59:54,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:59:54,843 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 08:59:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:55,162 INFO L93 Difference]: Finished difference Result 255 states and 304 transitions. [2022-12-14 08:59:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 08:59:55,162 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 08:59:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:55,164 INFO L225 Difference]: With dead ends: 255 [2022-12-14 08:59:55,164 INFO L226 Difference]: Without dead ends: 255 [2022-12-14 08:59:55,164 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 08:59:55,164 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 08:59:55,165 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 08:59:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-12-14 08:59:55,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-12-14 08:59:55,169 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 08:59:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 304 transitions. [2022-12-14 08:59:55,170 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 304 transitions. Word has length 23 [2022-12-14 08:59:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:55,170 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 304 transitions. [2022-12-14 08:59:55,170 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 08:59:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 304 transitions. [2022-12-14 08:59:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 08:59:55,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:55,170 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 08:59:55,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 08:59:55,171 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 08:59:55,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash 818836411, now seen corresponding path program 1 times [2022-12-14 08:59:55,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:55,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468296624] [2022-12-14 08:59:55,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:55,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:55,282 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 08:59:55,282 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:55,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468296624] [2022-12-14 08:59:55,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468296624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:55,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:55,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 08:59:55,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064128440] [2022-12-14 08:59:55,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:55,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 08:59:55,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:55,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 08:59:55,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:59:55,283 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 08:59:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:55,526 INFO L93 Difference]: Finished difference Result 253 states and 302 transitions. [2022-12-14 08:59:55,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 08:59:55,527 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 08:59:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:55,528 INFO L225 Difference]: With dead ends: 253 [2022-12-14 08:59:55,528 INFO L226 Difference]: Without dead ends: 253 [2022-12-14 08:59:55,529 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 08:59:55,529 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 08:59:55,529 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 08:59:55,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-12-14 08:59:55,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2022-12-14 08:59:55,535 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 08:59:55,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 302 transitions. [2022-12-14 08:59:55,537 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 302 transitions. Word has length 23 [2022-12-14 08:59:55,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:55,537 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 302 transitions. [2022-12-14 08:59:55,537 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 08:59:55,538 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 302 transitions. [2022-12-14 08:59:55,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 08:59:55,538 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:55,538 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 08:59:55,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 08:59:55,538 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 08:59:55,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:55,539 INFO L85 PathProgramCache]: Analyzing trace with hash -385857421, now seen corresponding path program 1 times [2022-12-14 08:59:55,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:55,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939468112] [2022-12-14 08:59:55,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:55,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:55,601 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 08:59:55,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:55,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939468112] [2022-12-14 08:59:55,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939468112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:55,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:55,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:59:55,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040547235] [2022-12-14 08:59:55,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:55,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:59:55,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:55,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:59:55,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:59:55,603 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 08:59:55,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:55,731 INFO L93 Difference]: Finished difference Result 252 states and 301 transitions. [2022-12-14 08:59:55,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:59:55,732 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 08:59:55,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:55,734 INFO L225 Difference]: With dead ends: 252 [2022-12-14 08:59:55,734 INFO L226 Difference]: Without dead ends: 252 [2022-12-14 08:59:55,734 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 08:59:55,734 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 08:59:55,735 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 08:59:55,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-12-14 08:59:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2022-12-14 08:59:55,745 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 08:59:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 301 transitions. [2022-12-14 08:59:55,747 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 301 transitions. Word has length 24 [2022-12-14 08:59:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:55,747 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 301 transitions. [2022-12-14 08:59:55,747 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 08:59:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 301 transitions. [2022-12-14 08:59:55,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 08:59:55,748 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:55,748 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 08:59:55,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 08:59:55,748 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 08:59:55,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:55,749 INFO L85 PathProgramCache]: Analyzing trace with hash -385857420, now seen corresponding path program 1 times [2022-12-14 08:59:55,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:55,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383945285] [2022-12-14 08:59:55,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:55,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:55,845 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 08:59:55,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:55,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383945285] [2022-12-14 08:59:55,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383945285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:55,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:55,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:59:55,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743773170] [2022-12-14 08:59:55,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:55,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:59:55,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:55,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:59:55,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:59:55,847 INFO L87 Difference]: Start difference. First operand 252 states and 301 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 08:59:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:55,963 INFO L93 Difference]: Finished difference Result 251 states and 300 transitions. [2022-12-14 08:59:55,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:59:55,964 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 08:59:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:55,965 INFO L225 Difference]: With dead ends: 251 [2022-12-14 08:59:55,965 INFO L226 Difference]: Without dead ends: 251 [2022-12-14 08:59:55,965 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 08:59:55,966 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 18 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:59:55,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 546 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:59:55,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-12-14 08:59:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-12-14 08:59:55,972 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 08:59:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 300 transitions. [2022-12-14 08:59:55,974 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 300 transitions. Word has length 24 [2022-12-14 08:59:55,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:55,974 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 300 transitions. [2022-12-14 08:59:55,974 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 08:59:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 300 transitions. [2022-12-14 08:59:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 08:59:55,975 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:55,975 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 08:59:55,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 08:59:55,975 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 08:59:55,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:55,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1441791788, now seen corresponding path program 1 times [2022-12-14 08:59:55,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:55,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656683293] [2022-12-14 08:59:55,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:55,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:56,227 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 08:59:56,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:56,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656683293] [2022-12-14 08:59:56,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656683293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:56,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:56,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 08:59:56,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966222044] [2022-12-14 08:59:56,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:56,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 08:59:56,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:56,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 08:59:56,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 08:59:56,229 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 08:59:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:56,525 INFO L93 Difference]: Finished difference Result 260 states and 310 transitions. [2022-12-14 08:59:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 08:59:56,525 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 08:59:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:56,526 INFO L225 Difference]: With dead ends: 260 [2022-12-14 08:59:56,526 INFO L226 Difference]: Without dead ends: 260 [2022-12-14 08:59:56,527 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 08:59:56,527 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 08:59:56,527 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 08:59:56,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-12-14 08:59:56,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2022-12-14 08:59:56,533 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 08:59:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 309 transitions. [2022-12-14 08:59:56,534 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 309 transitions. Word has length 26 [2022-12-14 08:59:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:56,534 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 309 transitions. [2022-12-14 08:59:56,534 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 08:59:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 309 transitions. [2022-12-14 08:59:56,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 08:59:56,535 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:56,535 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 08:59:56,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 08:59:56,536 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 08:59:56,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1600203618, now seen corresponding path program 1 times [2022-12-14 08:59:56,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:56,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746001124] [2022-12-14 08:59:56,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:56,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:57,084 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 08:59:57,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:57,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746001124] [2022-12-14 08:59:57,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746001124] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:59:57,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308038045] [2022-12-14 08:59:57,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:57,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:59:57,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:59:57,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:59:57,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 08:59:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:57,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-14 08:59:57,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:59:57,330 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 08:59:57,452 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-14 08:59:57,452 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 21 treesize of output 29 [2022-12-14 08:59:57,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:59:57,501 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 08:59:57,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:59:57,519 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 08:59:57,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 17 treesize of output 9 [2022-12-14 08:59:57,546 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 08:59:57,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:59:57,576 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_531) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|)) 1)) is different from false [2022-12-14 08:59:57,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:59:57,819 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 08:59:57,826 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 42 treesize of output 34 [2022-12-14 08:59:57,846 INFO L321 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-12-14 08:59:57,846 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 64 treesize of output 72 [2022-12-14 08:59:57,856 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 40 treesize of output 32 [2022-12-14 08:59:57,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:59:57,984 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 08:59:57,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:59:57,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:59:57,994 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 08:59:58,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:59:58,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 204 [2022-12-14 08:59:58,699 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 08:59:58,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308038045] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:59:58,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2058060752] [2022-12-14 08:59:58,714 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-12-14 08:59:58,714 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:59:58,717 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 08:59:58,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:59:58,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2022-12-14 08:59:58,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318455406] [2022-12-14 08:59:58,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:59:58,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 08:59:58,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:58,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 08:59:58,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=4, NotChecked=56, Total=930 [2022-12-14 08:59:58,721 INFO L87 Difference]: Start difference. First operand 259 states and 309 transitions. Second operand has 31 states, 25 states have (on average 2.32) internal successors, (58), 26 states have internal predecessors, (58), 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 09:00:00,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:00:00,392 INFO L93 Difference]: Finished difference Result 261 states and 310 transitions. [2022-12-14 09:00:00,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 09:00:00,393 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 2.32) internal successors, (58), 26 states have internal predecessors, (58), 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 09:00:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:00:00,393 INFO L225 Difference]: With dead ends: 261 [2022-12-14 09:00:00,394 INFO L226 Difference]: Without dead ends: 261 [2022-12-14 09:00:00,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=287, Invalid=1353, Unknown=4, NotChecked=78, Total=1722 [2022-12-14 09:00:00,394 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 87 mSDsluCounter, 3445 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 3645 SdHoareTripleChecker+Invalid, 2516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:00:00,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 3645 Invalid, 2516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2338 Invalid, 0 Unknown, 129 Unchecked, 1.2s Time] [2022-12-14 09:00:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-12-14 09:00:00,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2022-12-14 09:00:00,400 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 09:00:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 306 transitions. [2022-12-14 09:00:00,401 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 306 transitions. Word has length 37 [2022-12-14 09:00:00,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:00:00,402 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 306 transitions. [2022-12-14 09:00:00,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 2.32) internal successors, (58), 26 states have internal predecessors, (58), 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 09:00:00,402 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 306 transitions. [2022-12-14 09:00:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 09:00:00,403 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:00:00,403 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 09:00:00,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 09:00:00,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 09:00:00,604 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 09:00:00,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:00:00,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1600203617, now seen corresponding path program 1 times [2022-12-14 09:00:00,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:00:00,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148447075] [2022-12-14 09:00:00,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:00:00,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:00:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:00:01,169 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 09:00:01,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:00:01,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148447075] [2022-12-14 09:00:01,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148447075] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:00:01,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923079039] [2022-12-14 09:00:01,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:00:01,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:00:01,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:00:01,171 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:00:01,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 09:00:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:00:01,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-14 09:00:01,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:00:01,339 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 09:00:01,414 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 09:00:01,419 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 09:00:01,563 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-14 09:00:01,563 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 09:00:01,575 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-14 09:00:01,575 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 09:00:01,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:00:01,613 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 14 treesize of output 16 [2022-12-14 09:00:01,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:00:01,619 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 09:00:01,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:00:01,633 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 09:00:01,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:00:01,639 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 09:00:01,671 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 09:00:01,673 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 09:00:01,700 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 09:00:01,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:00:01,762 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_694 (Array Int Int)) (v_ArrVal_695 (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_695) |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_694) |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_695 (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_695) |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 09:00:02,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:00:02,484 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 89 treesize of output 90 [2022-12-14 09:00:02,489 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 133 treesize of output 117 [2022-12-14 09:00:02,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:00:02,495 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 110 treesize of output 95 [2022-12-14 09:00:02,499 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 148 treesize of output 132 [2022-12-14 09:00:02,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:00:02,511 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 176 treesize of output 172 [2022-12-14 09:00:02,516 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 157 treesize of output 149 [2022-12-14 09:00:02,519 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 160 treesize of output 150 [2022-12-14 09:00:02,528 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:00:02,528 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 141 treesize of output 146 [2022-12-14 09:00:02,534 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 137 treesize of output 135 [2022-12-14 09:00:03,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:00:03,406 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 09:00:03,408 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:00:03,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:00:03,414 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 09:00:03,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:00:03,428 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 09:00:03,433 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:00:03,433 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 09:00:03,436 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:00:03,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:00:03,443 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 09:00:03,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:00:03,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:00:03,452 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 09:00:11,620 WARN L233 SmtUtils]: Spent 8.09s 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 09:00:11,694 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 65 treesize of output 61 [2022-12-14 09:00:11,798 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 10 treesize of output 8 [2022-12-14 09:00:11,830 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 09:00:11,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923079039] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:00:11,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [118867635] [2022-12-14 09:00:11,834 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-12-14 09:00:11,834 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:00:11,834 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 09:00:11,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:00:11,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2022-12-14 09:00:11,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072348007] [2022-12-14 09:00:11,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:00:11,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 09:00:11,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:00:11,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 09:00:11,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=907, Unknown=3, NotChecked=60, Total=1056 [2022-12-14 09:00:11,837 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 09:00:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:00:14,506 INFO L93 Difference]: Finished difference Result 257 states and 305 transitions. [2022-12-14 09:00:14,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 09:00:14,506 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 09:00:14,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:00:14,507 INFO L225 Difference]: With dead ends: 257 [2022-12-14 09:00:14,507 INFO L226 Difference]: Without dead ends: 257 [2022-12-14 09:00:14,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=309, Invalid=1584, Unknown=3, NotChecked=84, Total=1980 [2022-12-14 09:00:14,508 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 99 mSDsluCounter, 3130 mSDsCounter, 0 mSdLazyCounter, 3176 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 3330 SdHoareTripleChecker+Invalid, 3351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 09:00:14,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 3330 Invalid, 3351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3176 Invalid, 0 Unknown, 122 Unchecked, 1.8s Time] [2022-12-14 09:00:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-12-14 09:00:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2022-12-14 09:00:14,512 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 09:00:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 305 transitions. [2022-12-14 09:00:14,513 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 305 transitions. Word has length 37 [2022-12-14 09:00:14,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:00:14,513 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 305 transitions. [2022-12-14 09:00:14,514 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 09:00:14,514 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 305 transitions. [2022-12-14 09:00:14,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 09:00:14,514 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:00:14,514 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 09:00:14,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 09:00:14,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 09:00:14,717 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 09:00:14,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:00:14,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1962745778, now seen corresponding path program 1 times [2022-12-14 09:00:14,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:00:14,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569553957] [2022-12-14 09:00:14,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:00:14,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:00:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:00:14,849 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 09:00:14,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:00:14,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569553957] [2022-12-14 09:00:14,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569553957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:00:14,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:00:14,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:00:14,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318491294] [2022-12-14 09:00:14,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:00:14,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:00:14,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:00:14,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:00:14,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:00:14,850 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 09:00:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:00:14,952 INFO L93 Difference]: Finished difference Result 246 states and 282 transitions. [2022-12-14 09:00:14,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:00:14,952 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 09:00:14,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:00:14,953 INFO L225 Difference]: With dead ends: 246 [2022-12-14 09:00:14,953 INFO L226 Difference]: Without dead ends: 246 [2022-12-14 09:00:14,953 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 09:00:14,954 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 09:00:14,954 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 09:00:14,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-12-14 09:00:14,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-12-14 09:00:14,959 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 09:00:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 282 transitions. [2022-12-14 09:00:14,960 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 282 transitions. Word has length 40 [2022-12-14 09:00:14,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:00:14,961 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 282 transitions. [2022-12-14 09:00:14,961 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 09:00:14,961 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 282 transitions. [2022-12-14 09:00:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 09:00:14,962 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:00:14,962 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 09:00:14,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 09:00:14,962 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 09:00:14,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:00:14,963 INFO L85 PathProgramCache]: Analyzing trace with hash -129068744, now seen corresponding path program 1 times [2022-12-14 09:00:14,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:00:14,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644400207] [2022-12-14 09:00:14,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:00:14,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:00:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:00:15,544 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 09:00:15,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:00:15,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644400207] [2022-12-14 09:00:15,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644400207] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:00:15,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986539879] [2022-12-14 09:00:15,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:00:15,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:00:15,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:00:15,545 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:00:15,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 09:00:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:00:15,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-14 09:00:15,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:00:15,704 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 09:00:15,743 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 8 treesize of output 4 [2022-12-14 09:00:15,901 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_952 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int)) (and (= (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_952) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~next~0#1.base|) (< |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-14 09:00:15,908 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_952 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|) (= (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_952) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) 0))) is different from true [2022-12-14 09:00:15,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:00:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2022-12-14 09:00:15,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:00:16,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986539879] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:00:16,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1550818235] [2022-12-14 09:00:16,309 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-12-14 09:00:16,309 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:00:16,309 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 09:00:16,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:00:16,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2022-12-14 09:00:16,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872711789] [2022-12-14 09:00:16,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:00:16,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 09:00:16,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:00:16,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 09:00:16,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=625, Unknown=11, NotChecked=102, Total=812 [2022-12-14 09:00:16,311 INFO L87 Difference]: Start difference. First operand 246 states and 282 transitions. Second operand has 28 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 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 09:00:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:00:22,218 INFO L93 Difference]: Finished difference Result 249 states and 284 transitions. [2022-12-14 09:00:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 09:00:22,219 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 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 09:00:22,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:00:22,220 INFO L225 Difference]: With dead ends: 249 [2022-12-14 09:00:22,220 INFO L226 Difference]: Without dead ends: 246 [2022-12-14 09:00:22,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=202, Invalid=1426, Unknown=20, NotChecked=158, Total=1806 [2022-12-14 09:00:22,220 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 123 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 33 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 2880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 495 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 09:00:22,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 2088 Invalid, 2880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2347 Invalid, 5 Unknown, 495 Unchecked, 1.3s Time] [2022-12-14 09:00:22,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-12-14 09:00:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-12-14 09:00:22,224 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 09:00:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 281 transitions. [2022-12-14 09:00:22,224 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 281 transitions. Word has length 46 [2022-12-14 09:00:22,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:00:22,225 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 281 transitions. [2022-12-14 09:00:22,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 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 09:00:22,225 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 281 transitions. [2022-12-14 09:00:22,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 09:00:22,225 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:00:22,225 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 09:00:22,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 09:00:22,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:00:22,426 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 09:00:22,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:00:22,428 INFO L85 PathProgramCache]: Analyzing trace with hash 557477989, now seen corresponding path program 1 times [2022-12-14 09:00:22,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:00:22,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803508208] [2022-12-14 09:00:22,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:00:22,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:00:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:00:23,888 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 09:00:23,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:00:23,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803508208] [2022-12-14 09:00:23,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803508208] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:00:23,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634143335] [2022-12-14 09:00:23,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:00:23,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:00:23,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:00:23,889 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:00:23,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 09:00:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:00:24,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 09:00:24,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:00:24,128 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 09:00:24,137 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|) (exists ((v_ArrVal_1153 Int)) (= |c_#valid| (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1153)))) is different from true [2022-12-14 09:00:24,251 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1154 Int) (v_ArrVal_1153 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_1153))) (and (= |c_#valid| (store .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1154)) (= (select .cse0 |##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|)))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-12-14 09:00:24,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:00:24,259 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 09:00:24,264 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 09:00:24,293 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| Int) (v_ArrVal_1154 Int) (v_ArrVal_1153 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_1153))) (and (= |c_#valid| (store (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| v_ArrVal_1154) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1)) (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| |c_#StackHeapBarrier|) (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47|) 0)))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-12-14 09:00:24,330 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| Int) (v_ArrVal_1154 Int) (v_ArrVal_1153 Int) (v_ArrVal_1156 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_1153))) (and (= |c_#valid| (store (store (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| v_ArrVal_1154) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_43| v_ArrVal_1156)) (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_43|) (= 0 (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47|))))) is different from true [2022-12-14 09:00:24,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:00:24,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:00:24,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:00:24,400 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 09:00:24,400 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 09:00:24,408 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 09:00:24,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:00:24,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634143335] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:00:24,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1639442879] [2022-12-14 09:00:24,619 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-12-14 09:00:24,619 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:00:24,620 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 09:00:24,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:00:24,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 12] total 31 [2022-12-14 09:00:24,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170410312] [2022-12-14 09:00:24,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:00:24,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 09:00:24,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:00:24,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 09:00:24,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=679, Unknown=5, NotChecked=280, Total=1056 [2022-12-14 09:00:24,622 INFO L87 Difference]: Start difference. First operand 246 states and 281 transitions. Second operand has 32 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 29 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 09:00:52,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:00:52,525 INFO L93 Difference]: Finished difference Result 270 states and 316 transitions. [2022-12-14 09:00:52,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 09:00:52,525 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 29 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 09:00:52,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:00:52,526 INFO L225 Difference]: With dead ends: 270 [2022-12-14 09:00:52,526 INFO L226 Difference]: Without dead ends: 270 [2022-12-14 09:00:52,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=239, Invalid=1834, Unknown=17, NotChecked=460, Total=2550 [2022-12-14 09:00:52,527 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 283 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 2633 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 4038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1316 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-14 09:00:52,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1314 Invalid, 4038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2633 Invalid, 0 Unknown, 1316 Unchecked, 2.4s Time] [2022-12-14 09:00:52,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-12-14 09:00:52,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 254. [2022-12-14 09:00:52,530 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 09:00:52,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 293 transitions. [2022-12-14 09:00:52,531 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 293 transitions. Word has length 47 [2022-12-14 09:00:52,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:00:52,531 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 293 transitions. [2022-12-14 09:00:52,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 29 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 09:00:52,532 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 293 transitions. [2022-12-14 09:00:52,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 09:00:52,532 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:00:52,532 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 09:00:52,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 09:00:52,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:00:52,733 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 09:00:52,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:00:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash 557477990, now seen corresponding path program 1 times [2022-12-14 09:00:52,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:00:52,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772855995] [2022-12-14 09:00:52,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:00:52,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:00:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:00:53,482 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 09:00:53,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:00:53,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772855995] [2022-12-14 09:00:53,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772855995] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:00:53,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974393984] [2022-12-14 09:00:53,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:00:53,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:00:53,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:00:53,484 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:00:53,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 09:00:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:00:53,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-14 09:00:53,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:00:53,652 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 09:00:53,734 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 09:00:53,737 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 09:00:53,744 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1359 Int)) (= |c_#valid| (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1359))) (exists ((v_ArrVal_1358 Int)) (= (store |c_old(#length)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1358) |c_#length|)) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-12-14 09:00:53,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:00:53,956 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 09:00:54,048 WARN L859 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_~#dll~0.base| Int)) (and (exists ((v_ArrVal_1361 Int) (v_ArrVal_1360 Int) (v_ArrVal_1362 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_1358 Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66| Int) (v_ArrVal_1359 Int)) (let ((.cse1 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_1359))) (let ((.cse0 (store .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1360))) (and (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66|) 0) (= |c_#length| (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_1358) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1361) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66| v_ArrVal_1362)) (= (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 |dll_create_generic_~#dll~0.base|) 1))))) (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|))) is different from true [2022-12-14 09:00:54,138 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1361 Int) (v_ArrVal_1360 Int) (|dll_create_generic_~#dll~0.base| Int) (v_ArrVal_1362 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_1358 Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66| Int) (v_ArrVal_1359 Int)) (let ((.cse1 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_1359))) (let ((.cse0 (store .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1360))) (and (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66|) 0) (= |c_#length| (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_1358) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1361) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66| v_ArrVal_1362)) (= (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 |dll_create_generic_~#dll~0.base|) 1))))) is different from true [2022-12-14 09:00:54,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:00:54,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:00:54,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:00:54,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:00:54,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:00:54,182 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 09:00:54,182 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 20 treesize of output 30 [2022-12-14 09:00:54,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:00:54,211 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-14 09:00:54,211 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 09:00:54,252 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 09:00:54,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:00:56,665 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| Int)) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| |c_#StackHeapBarrier|)) (forall ((|v_dll_create_generic_~#dll~0.base_62| Int)) (or (forall ((v_ArrVal_1399 Int)) (let ((.cse1 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_62| v_ArrVal_1399))) (or (forall ((v_ArrVal_1400 Int)) (let ((.cse0 (store .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| v_ArrVal_1400))) (or (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_84| Int)) (or (not (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_84|) 0)) (forall ((v_ArrVal_1398 Int) (v_ArrVal_1397 Int) (v_ArrVal_1401 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_1401) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| v_ArrVal_1397) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_84| v_ArrVal_1398) |c_dll_insert_master_~item~1#1.base|))))) (not (= (select .cse0 |v_dll_create_generic_~#dll~0.base_62|) 1))))) (not (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83|) 0))))) (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_62|)))))) (or (forall ((|v_dll_create_generic_~#dll~0.base_62| Int) (v_ArrVal_1400 Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_84| Int) (v_ArrVal_1399 Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| Int)) (let ((.cse3 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_62| v_ArrVal_1399))) (let ((.cse2 (store .cse3 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| v_ArrVal_1400))) (or (not (= (select .cse2 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_84|) 0)) (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_62|)) (not (= (select .cse2 |v_dll_create_generic_~#dll~0.base_62|) 1)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| |c_#StackHeapBarrier|)) (not (= (select .cse3 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83|) 0)))))) (<= 0 (+ |c_dll_insert_master_~item~1#1.offset| 8)))) is different from false [2022-12-14 09:00:56,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974393984] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:00:56,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [723560731] [2022-12-14 09:00:56,670 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-12-14 09:00:56,670 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:00:56,670 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 09:00:56,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:00:56,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2022-12-14 09:00:56,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355103854] [2022-12-14 09:00:56,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:00:56,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 09:00:56,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:00:56,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 09:00:56,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=465, Unknown=4, NotChecked=188, Total=756 [2022-12-14 09:00:56,672 INFO L87 Difference]: Start difference. First operand 254 states and 293 transitions. Second operand has 26 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 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 09:01:09,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:01:09,389 INFO L93 Difference]: Finished difference Result 261 states and 302 transitions. [2022-12-14 09:01:09,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 09:01:09,389 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 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 09:01:09,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:01:09,391 INFO L225 Difference]: With dead ends: 261 [2022-12-14 09:01:09,391 INFO L226 Difference]: Without dead ends: 261 [2022-12-14 09:01:09,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=171, Invalid=833, Unknown=4, NotChecked=252, Total=1260 [2022-12-14 09:01:09,392 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 141 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 22 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 2972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 739 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 09:01:09,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1056 Invalid, 2972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2197 Invalid, 14 Unknown, 739 Unchecked, 1.6s Time] [2022-12-14 09:01:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-12-14 09:01:09,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 254. [2022-12-14 09:01:09,395 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 09:01:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 291 transitions. [2022-12-14 09:01:09,396 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 291 transitions. Word has length 47 [2022-12-14 09:01:09,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:01:09,396 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 291 transitions. [2022-12-14 09:01:09,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 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 09:01:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 291 transitions. [2022-12-14 09:01:09,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 09:01:09,397 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:01:09,397 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 09:01:09,401 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 09:01:09,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-14 09:01:09,599 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 09:01:09,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:01:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash 101967615, now seen corresponding path program 1 times [2022-12-14 09:01:09,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:01:09,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962810566] [2022-12-14 09:01:09,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:01:09,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:01:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:01:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 09:01:10,342 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:01:10,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962810566] [2022-12-14 09:01:10,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962810566] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:01:10,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665184975] [2022-12-14 09:01:10,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:01:10,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:01:10,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:01:10,343 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:01:10,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 09:01:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:01:10,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 09:01:10,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:01:10,529 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 09:01:10,557 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_1593 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1593))))) is different from true [2022-12-14 09:01:14,644 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 09:01:19,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:01:19,491 INFO L321 Elim1Store]: treesize reduction 67, result has 31.6 percent of original size [2022-12-14 09:01:19,491 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 09:01:19,501 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 09:01:19,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:01:19,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665184975] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:01:19,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1431888773] [2022-12-14 09:01:19,639 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 09:01:19,639 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:01:19,640 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 09:01:19,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:01:19,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2022-12-14 09:01:19,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410829902] [2022-12-14 09:01:19,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:01:19,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 09:01:19,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:01:19,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 09:01:19,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=326, Unknown=6, NotChecked=74, Total=462 [2022-12-14 09:01:19,642 INFO L87 Difference]: Start difference. First operand 254 states and 291 transitions. Second operand has 21 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-12-14 09:01:21,662 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 09:01:23,668 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 09:01:32,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:01:32,531 INFO L93 Difference]: Finished difference Result 262 states and 304 transitions. [2022-12-14 09:01:32,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 09:01:32,532 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 48 [2022-12-14 09:01:32,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:01:32,533 INFO L225 Difference]: With dead ends: 262 [2022-12-14 09:01:32,533 INFO L226 Difference]: Without dead ends: 262 [2022-12-14 09:01:32,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=180, Invalid=1079, Unknown=9, NotChecked=138, Total=1406 [2022-12-14 09:01:32,534 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 250 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 67 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 490 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:01:32,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1078 Invalid, 2114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1553 Invalid, 4 Unknown, 490 Unchecked, 6.1s Time] [2022-12-14 09:01:32,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-12-14 09:01:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 256. [2022-12-14 09:01:32,537 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 09:01:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 295 transitions. [2022-12-14 09:01:32,538 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 295 transitions. Word has length 48 [2022-12-14 09:01:32,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:01:32,538 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 295 transitions. [2022-12-14 09:01:32,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 3.125) internal successors, (50), 17 states have internal predecessors, (50), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-12-14 09:01:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 295 transitions. [2022-12-14 09:01:32,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 09:01:32,539 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:01:32,539 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 09:01:32,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 09:01:32,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 09:01:32,741 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 09:01:32,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:01:32,742 INFO L85 PathProgramCache]: Analyzing trace with hash 101967616, now seen corresponding path program 1 times [2022-12-14 09:01:32,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:01:32,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473549077] [2022-12-14 09:01:32,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:01:32,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:01:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:01:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:01:34,706 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:01:34,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473549077] [2022-12-14 09:01:34,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473549077] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:01:34,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732063395] [2022-12-14 09:01:34,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:01:34,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:01:34,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:01:34,707 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:01:34,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 09:01:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:01:34,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 09:01:34,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:01:35,068 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 09:01:35,070 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 09:01:35,132 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 09:01:35,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:01:35,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:01:35,300 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 11 treesize of output 7 [2022-12-14 09:01:35,307 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_1811 Int)) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1811))))) is different from true [2022-12-14 09:01:35,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:01:35,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:01:35,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:01:35,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:01:35,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:01:35,537 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 09:01:35,537 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 20 treesize of output 30 [2022-12-14 09:01:35,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:01:35,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:01:35,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:01:35,551 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 09:01:35,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-12-14 09:01:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-12-14 09:01:35,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:01:43,851 WARN L233 SmtUtils]: Spent 7.94s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:01:43,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732063395] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:01:43,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [471305552] [2022-12-14 09:01:43,853 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 09:01:43,853 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:01:43,853 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 09:01:43,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:01:43,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15] total 39 [2022-12-14 09:01:43,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263924587] [2022-12-14 09:01:43,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:01:43,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-14 09:01:43,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:01:43,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-14 09:01:43,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1421, Unknown=1, NotChecked=76, Total=1640 [2022-12-14 09:01:43,855 INFO L87 Difference]: Start difference. First operand 256 states and 295 transitions. Second operand has 40 states, 33 states have (on average 2.212121212121212) internal successors, (73), 33 states have internal predecessors, (73), 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 09:01:49,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:01:49,218 INFO L93 Difference]: Finished difference Result 261 states and 301 transitions. [2022-12-14 09:01:49,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 09:01:49,219 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 33 states have (on average 2.212121212121212) internal successors, (73), 33 states have internal predecessors, (73), 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 09:01:49,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:01:49,219 INFO L225 Difference]: With dead ends: 261 [2022-12-14 09:01:49,220 INFO L226 Difference]: Without dead ends: 261 [2022-12-14 09:01:49,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=385, Invalid=3400, Unknown=1, NotChecked=120, Total=3906 [2022-12-14 09:01:49,220 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 371 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 3305 mSolverCounterSat, 146 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 3732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 3305 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 245 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:01:49,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1651 Invalid, 3732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 3305 Invalid, 36 Unknown, 245 Unchecked, 3.2s Time] [2022-12-14 09:01:49,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-12-14 09:01:49,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 260. [2022-12-14 09:01:49,223 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 09:01:49,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 299 transitions. [2022-12-14 09:01:49,224 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 299 transitions. Word has length 48 [2022-12-14 09:01:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:01:49,224 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 299 transitions. [2022-12-14 09:01:49,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 33 states have (on average 2.212121212121212) internal successors, (73), 33 states have internal predecessors, (73), 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 09:01:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 299 transitions. [2022-12-14 09:01:49,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 09:01:49,225 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:01:49,225 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 09:01:49,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 09:01:49,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:01:49,426 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 09:01:49,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:01:49,428 INFO L85 PathProgramCache]: Analyzing trace with hash 705354207, now seen corresponding path program 1 times [2022-12-14 09:01:49,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:01:49,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744888107] [2022-12-14 09:01:49,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:01:49,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:01:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:01:49,683 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 09:01:49,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:01:49,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744888107] [2022-12-14 09:01:49,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744888107] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:01:49,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98172143] [2022-12-14 09:01:49,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:01:49,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:01:49,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:01:49,685 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:01:49,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 09:01:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:01:49,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 09:01:49,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:01:49,946 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 09:01:49,946 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 09:01:49,951 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 09:01:49,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:01:50,110 INFO L321 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-12-14 09:01:50,110 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 09:01:50,137 INFO L321 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-12-14 09:01:50,137 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 09:01:50,167 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 09:01:50,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98172143] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:01:50,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1658821578] [2022-12-14 09:01:50,170 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-12-14 09:01:50,170 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:01:50,170 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 09:01:50,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:01:50,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-12-14 09:01:50,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344032595] [2022-12-14 09:01:50,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:01:50,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 09:01:50,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:01:50,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 09:01:50,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-14 09:01:50,172 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 09:01:50,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:01:50,644 INFO L93 Difference]: Finished difference Result 258 states and 297 transitions. [2022-12-14 09:01:50,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 09:01:50,644 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 09:01:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:01:50,645 INFO L225 Difference]: With dead ends: 258 [2022-12-14 09:01:50,645 INFO L226 Difference]: Without dead ends: 258 [2022-12-14 09:01:50,645 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 09:01:50,646 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 79 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 09:01:50,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1526 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 09:01:50,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-12-14 09:01:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-12-14 09:01:50,649 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 09:01:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 297 transitions. [2022-12-14 09:01:50,649 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 297 transitions. Word has length 60 [2022-12-14 09:01:50,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:01:50,649 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 297 transitions. [2022-12-14 09:01:50,649 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 09:01:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 297 transitions. [2022-12-14 09:01:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 09:01:50,650 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:01:50,650 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 09:01:50,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-14 09:01:50,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:01:50,851 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 09:01:50,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:01:50,852 INFO L85 PathProgramCache]: Analyzing trace with hash 705354208, now seen corresponding path program 1 times [2022-12-14 09:01:50,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:01:50,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691684084] [2022-12-14 09:01:50,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:01:50,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:01:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:01:51,290 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 09:01:51,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:01:51,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691684084] [2022-12-14 09:01:51,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691684084] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:01:51,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625657096] [2022-12-14 09:01:51,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:01:51,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:01:51,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:01:51,291 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:01:51,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 09:01:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:01:51,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 09:01:51,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:01:51,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:01:51,699 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 09:01:51,712 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 09:01:51,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:01:54,187 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 36 treesize of output 32 [2022-12-14 09:01:54,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:01:54,288 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 09:01:54,288 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 10 [2022-12-14 09:01:54,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:01:54,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:01:54,368 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 14 treesize of output 18 [2022-12-14 09:01:54,462 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 09:01:54,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625657096] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:01:54,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1593926679] [2022-12-14 09:01:54,464 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-12-14 09:01:54,464 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:01:54,464 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 09:01:54,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:01:54,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2022-12-14 09:01:54,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905666187] [2022-12-14 09:01:54,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:01:54,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 09:01:54,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:01:54,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 09:01:54,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 09:01:54,467 INFO L87 Difference]: Start difference. First operand 258 states and 297 transitions. Second operand has 33 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 24 states have internal predecessors, (73), 16 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-12-14 09:01:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:01:55,358 INFO L93 Difference]: Finished difference Result 256 states and 295 transitions. [2022-12-14 09:01:55,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 09:01:55,358 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 24 states have internal predecessors, (73), 16 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 60 [2022-12-14 09:01:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:01:55,360 INFO L225 Difference]: With dead ends: 256 [2022-12-14 09:01:55,360 INFO L226 Difference]: Without dead ends: 256 [2022-12-14 09:01:55,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=177, Invalid=1383, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 09:01:55,361 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 161 mSDsluCounter, 2447 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 09:01:55,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 2632 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 09:01:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-12-14 09:01:55,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-12-14 09:01:55,367 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 09:01:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 295 transitions. [2022-12-14 09:01:55,369 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 295 transitions. Word has length 60 [2022-12-14 09:01:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:01:55,369 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 295 transitions. [2022-12-14 09:01:55,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 24 states have internal predecessors, (73), 16 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-12-14 09:01:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 295 transitions. [2022-12-14 09:01:55,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 09:01:55,370 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:01:55,370 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 09:01:55,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 09:01:55,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-14 09:01:55,571 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 09:01:55,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:01:55,571 INFO L85 PathProgramCache]: Analyzing trace with hash 496025889, now seen corresponding path program 1 times [2022-12-14 09:01:55,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:01:55,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36905698] [2022-12-14 09:01:55,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:01:55,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:01:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:01:57,551 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:01:57,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:01:57,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36905698] [2022-12-14 09:01:57,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36905698] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:01:57,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670907724] [2022-12-14 09:01:57,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:01:57,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:01:57,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:01:57,553 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:01:57,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 09:01:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:01:57,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 81 conjunts are in the unsatisfiable core [2022-12-14 09:01:57,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:01:57,750 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 09:01:57,809 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 09:01:57,940 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 09:01:57,940 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 09:01:58,054 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 09:01:58,057 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2573 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_2573))) is different from true [2022-12-14 09:01:58,141 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 09:01:58,142 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 09:01:58,316 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2578 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 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_2578) |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 09:02:02,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:02,459 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 09:02:03,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:03,648 INFO L321 Elim1Store]: treesize reduction 146, result has 23.2 percent of original size [2022-12-14 09:02:03,648 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 09:02:03,678 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 09:02:03,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:02:04,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:04,031 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 09:02:04,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:02:04,037 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 09:02:04,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670907724] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:02:04,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [803454876] [2022-12-14 09:02:04,122 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 09:02:04,123 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:02:04,123 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 09:02:04,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:02:04,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21] total 42 [2022-12-14 09:02:04,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038890007] [2022-12-14 09:02:04,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:02:04,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 09:02:04,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:02:04,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 09:02:04,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1539, Unknown=6, NotChecked=162, Total=1892 [2022-12-14 09:02:04,125 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 09:02:10,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:02:10,498 INFO L93 Difference]: Finished difference Result 292 states and 344 transitions. [2022-12-14 09:02:10,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 09:02:10,499 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 09:02:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:02:10,500 INFO L225 Difference]: With dead ends: 292 [2022-12-14 09:02:10,500 INFO L226 Difference]: Without dead ends: 292 [2022-12-14 09:02:10,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=596, Invalid=4086, Unknown=18, NotChecked=270, Total=4970 [2022-12-14 09:02:10,501 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 313 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 3123 mSolverCounterSat, 98 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 3767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3123 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 534 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-12-14 09:02:10,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1354 Invalid, 3767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3123 Invalid, 12 Unknown, 534 Unchecked, 3.7s Time] [2022-12-14 09:02:10,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-12-14 09:02:10,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 265. [2022-12-14 09:02:10,505 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 09:02:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 310 transitions. [2022-12-14 09:02:10,505 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 310 transitions. Word has length 61 [2022-12-14 09:02:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:02:10,505 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 310 transitions. [2022-12-14 09:02:10,505 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 09:02:10,506 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 310 transitions. [2022-12-14 09:02:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 09:02:10,506 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:02:10,506 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 09:02:10,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 09:02:10,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 09:02:10,707 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 09:02:10,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:02:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash 496025890, now seen corresponding path program 1 times [2022-12-14 09:02:10,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:02:10,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167308764] [2022-12-14 09:02:10,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:02:10,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:02:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:02:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:02:12,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:02:12,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167308764] [2022-12-14 09:02:12,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167308764] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:02:12,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920267011] [2022-12-14 09:02:12,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:02:12,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:02:12,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:02:12,373 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:02:12,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 09:02:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:02:12,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 135 conjunts are in the unsatisfiable core [2022-12-14 09:02:12,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:02:12,552 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 09:02:12,677 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 09:02:12,819 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 09:02:12,919 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:02:12,919 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 09:02:12,923 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 8 treesize of output 4 [2022-12-14 09:02:13,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:13,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:13,522 INFO L321 Elim1Store]: treesize reduction 62, result has 25.3 percent of original size [2022-12-14 09:02:13,523 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 118 treesize of output 154 [2022-12-14 09:02:13,528 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 144 treesize of output 117 [2022-12-14 09:02:13,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:13,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:13,554 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 25 [2022-12-14 09:02:13,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:13,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:13,703 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-14 09:02:13,704 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 32 treesize of output 22 [2022-12-14 09:02:13,708 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 09:02:14,002 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 09:02:14,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:14,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:14,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:14,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:14,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:14,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:14,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:14,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:14,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:14,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:14,271 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 0 case distinctions, treesize of input 23 treesize of output 31 [2022-12-14 09:02:14,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:14,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:14,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:14,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:14,301 INFO L321 Elim1Store]: treesize reduction 48, result has 26.2 percent of original size [2022-12-14 09:02:14,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 48 [2022-12-14 09:02:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 09:02:14,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:02:23,648 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:02:23,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920267011] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:02:23,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1654144994] [2022-12-14 09:02:23,650 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 09:02:23,650 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:02:23,651 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 09:02:23,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:02:23,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27] total 43 [2022-12-14 09:02:23,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152919160] [2022-12-14 09:02:23,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:02:23,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-14 09:02:23,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:02:23,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-14 09:02:23,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1796, Unknown=7, NotChecked=0, Total=2070 [2022-12-14 09:02:23,653 INFO L87 Difference]: Start difference. First operand 265 states and 310 transitions. Second operand has 44 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 39 states have internal predecessors, (90), 10 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-12-14 09:02:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:02:28,562 INFO L93 Difference]: Finished difference Result 272 states and 319 transitions. [2022-12-14 09:02:28,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 09:02:28,563 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 39 states have internal predecessors, (90), 10 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 61 [2022-12-14 09:02:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:02:28,564 INFO L225 Difference]: With dead ends: 272 [2022-12-14 09:02:28,564 INFO L226 Difference]: Without dead ends: 272 [2022-12-14 09:02:28,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=399, Invalid=2552, Unknown=19, NotChecked=0, Total=2970 [2022-12-14 09:02:28,565 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 249 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 3559 mSolverCounterSat, 66 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 3646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3559 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-12-14 09:02:28,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1214 Invalid, 3646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3559 Invalid, 21 Unknown, 0 Unchecked, 3.9s Time] [2022-12-14 09:02:28,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-12-14 09:02:28,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 265. [2022-12-14 09:02:28,570 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 09:02:28,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 308 transitions. [2022-12-14 09:02:28,570 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 308 transitions. Word has length 61 [2022-12-14 09:02:28,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:02:28,571 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 308 transitions. [2022-12-14 09:02:28,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 39 states have internal predecessors, (90), 10 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-12-14 09:02:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 308 transitions. [2022-12-14 09:02:28,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-14 09:02:28,572 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:02:28,572 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 09:02:28,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 09:02:28,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:02:28,773 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 09:02:28,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:02:28,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2048736162, now seen corresponding path program 1 times [2022-12-14 09:02:28,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:02:28,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965445673] [2022-12-14 09:02:28,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:02:28,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:02:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:02:29,291 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 09:02:29,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:02:29,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965445673] [2022-12-14 09:02:29,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965445673] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:02:29,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519819956] [2022-12-14 09:02:29,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:02:29,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:02:29,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:02:29,292 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:02:29,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 09:02:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:02:29,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 09:02:29,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:02:29,538 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 09:02:29,685 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-14 09:02:29,685 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 21 treesize of output 29 [2022-12-14 09:02:29,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:29,728 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 09:02:29,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:29,740 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 09:02:29,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:29,751 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 09:02:29,777 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 09:02:29,781 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 09:02:29,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:02:30,121 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:30,121 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 09:02:30,125 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 42 treesize of output 34 [2022-12-14 09:02:30,143 INFO L321 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-12-14 09:02:30,144 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 64 treesize of output 72 [2022-12-14 09:02:30,150 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 40 treesize of output 32 [2022-12-14 09:02:30,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:30,294 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 09:02:30,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:02:30,303 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 09:02:30,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 22 [2022-12-14 09:02:30,321 INFO L321 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-12-14 09:02:30,322 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 09:02:30,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:30,410 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 09:02:30,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:02:30,418 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:30,418 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 09:02:30,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:30,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 204 [2022-12-14 09:02:31,096 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 09:02:31,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519819956] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:02:31,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1343313067] [2022-12-14 09:02:31,098 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-12-14 09:02:31,099 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:02:31,099 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 09:02:31,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:02:31,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 32 [2022-12-14 09:02:31,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646499142] [2022-12-14 09:02:31,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:02:31,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 09:02:31,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:02:31,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 09:02:31,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=942, Unknown=14, NotChecked=0, Total=1056 [2022-12-14 09:02:31,101 INFO L87 Difference]: Start difference. First operand 265 states and 308 transitions. Second operand has 33 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 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 09:02:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:02:32,732 INFO L93 Difference]: Finished difference Result 266 states and 308 transitions. [2022-12-14 09:02:32,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 09:02:32,732 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 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 09:02:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:02:32,733 INFO L225 Difference]: With dead ends: 266 [2022-12-14 09:02:32,733 INFO L226 Difference]: Without dead ends: 266 [2022-12-14 09:02:32,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=234, Invalid=1558, Unknown=14, NotChecked=0, Total=1806 [2022-12-14 09:02:32,734 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 96 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:02:32,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 2766 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 09:02:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-12-14 09:02:32,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-12-14 09:02:32,737 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 09:02:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 308 transitions. [2022-12-14 09:02:32,737 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 308 transitions. Word has length 63 [2022-12-14 09:02:32,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:02:32,737 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 308 transitions. [2022-12-14 09:02:32,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 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 09:02:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 308 transitions. [2022-12-14 09:02:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-14 09:02:32,738 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:02:32,738 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 09:02:32,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-14 09:02:32,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 09:02:32,940 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 09:02:32,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:02:32,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2048736161, now seen corresponding path program 1 times [2022-12-14 09:02:32,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:02:32,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565016595] [2022-12-14 09:02:32,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:02:32,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:02:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:02:33,679 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 09:02:33,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:02:33,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565016595] [2022-12-14 09:02:33,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565016595] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:02:33,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757396349] [2022-12-14 09:02:33,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:02:33,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:02:33,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:02:33,681 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:02:33,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 09:02:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:02:33,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-14 09:02:33,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:02:33,997 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 09:02:34,002 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 09:02:34,201 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-14 09:02:34,201 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 09:02:34,204 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 09:02:34,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:34,241 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 14 treesize of output 16 [2022-12-14 09:02:34,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:34,247 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 09:02:34,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:34,255 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 09:02:34,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:34,264 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 09:02:34,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:34,273 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 09:02:34,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:34,278 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 09:02:34,311 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 09:02:34,314 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 09:02:34,319 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 09:02:34,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:02:34,382 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3465 (Array Int Int)) (v_ArrVal_3466 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_dll_insert_master_alloc_or_die_master_~ptr~1#1.base| v_ArrVal_3466) |c_dll_insert_master_~dll#1.base|) |c_dll_insert_master_~dll#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_dll_insert_master_alloc_or_die_master_~ptr~1#1.base| v_ArrVal_3465) |c_dll_insert_master_~dll#1.base|) |c_dll_insert_master_~dll#1.offset|)))) (forall ((v_ArrVal_3466 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_dll_insert_master_alloc_or_die_master_~ptr~1#1.base| v_ArrVal_3466) |c_dll_insert_master_~dll#1.base|) |c_dll_insert_master_~dll#1.offset|) 4)))) is different from false [2022-12-14 09:02:36,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:36,719 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 09:02:36,722 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 09:02:36,728 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:36,729 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 09:02:36,733 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 09:02:36,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:36,744 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 09:02:36,749 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 09:02:36,753 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 09:02:36,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:36,769 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 09:02:36,777 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 09:02:38,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:38,011 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 09:02:38,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:38,019 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 09:02:38,033 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 09:02:38,033 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 09:02:38,043 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 09:02:38,044 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 09:02:38,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:38,061 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 09:02:38,066 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 190 treesize of output 178 [2022-12-14 09:02:38,072 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 161 treesize of output 153 [2022-12-14 09:02:38,091 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:38,092 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 09:02:38,104 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 09:02:39,284 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:39,284 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 09:02:39,290 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:39,290 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 09:02:39,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:02:39,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:39,301 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 09:02:39,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:02:39,313 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:39,313 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 09:02:39,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:39,344 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 09:02:39,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:02:39,351 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:39,351 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 09:02:51,585 WARN L233 SmtUtils]: Spent 12.17s 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 09:02:51,609 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 09:02:51,643 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:02:51,643 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 09:02:52,001 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 3 not checked. [2022-12-14 09:02:52,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757396349] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:02:52,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1515284856] [2022-12-14 09:02:52,002 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-12-14 09:02:52,002 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:02:52,002 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 09:02:52,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:02:52,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 35 [2022-12-14 09:02:52,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786788753] [2022-12-14 09:02:52,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:02:52,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 09:02:52,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:02:52,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 09:02:52,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1081, Unknown=5, NotChecked=66, Total=1260 [2022-12-14 09:02:52,004 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 09:02:54,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:02:54,082 INFO L93 Difference]: Finished difference Result 265 states and 307 transitions. [2022-12-14 09:02:54,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 09:02:54,083 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 09:02:54,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:02:54,084 INFO L225 Difference]: With dead ends: 265 [2022-12-14 09:02:54,084 INFO L226 Difference]: Without dead ends: 265 [2022-12-14 09:02:54,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=265, Invalid=1896, Unknown=5, NotChecked=90, Total=2256 [2022-12-14 09:02:54,085 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 98 mSDsluCounter, 2290 mSDsCounter, 0 mSdLazyCounter, 1837 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 09:02:54,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 2488 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1837 Invalid, 0 Unknown, 129 Unchecked, 1.5s Time] [2022-12-14 09:02:54,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-12-14 09:02:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2022-12-14 09:02:54,087 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 09:02:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 307 transitions. [2022-12-14 09:02:54,088 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 307 transitions. Word has length 63 [2022-12-14 09:02:54,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:02:54,088 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 307 transitions. [2022-12-14 09:02:54,088 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 09:02:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 307 transitions. [2022-12-14 09:02:54,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-14 09:02:54,089 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:02:54,089 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 09:02:54,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 09:02:54,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 09:02:54,290 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 09:02:54,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:02:54,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1803047485, now seen corresponding path program 1 times [2022-12-14 09:02:54,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:02:54,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660620911] [2022-12-14 09:02:54,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:02:54,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:02:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:02:55,505 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 09:02:55,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:02:55,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660620911] [2022-12-14 09:02:55,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660620911] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:02:55,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124345484] [2022-12-14 09:02:55,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:02:55,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:02:55,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:02:55,506 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:02:55,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 09:02:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:02:55,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 09:02:55,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:02:55,781 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 09:02:55,826 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 09:02:55,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:55,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:55,927 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 11 treesize of output 7 [2022-12-14 09:02:55,935 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_3731 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_3731))) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-14 09:02:56,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:56,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:56,051 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 11 treesize of output 7 [2022-12-14 09:02:56,058 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3732 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_3732))) is different from true [2022-12-14 09:02:56,062 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3732 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_3732))) is different from true [2022-12-14 09:02:56,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:56,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:56,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:56,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:56,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:02:56,410 INFO L321 Elim1Store]: treesize reduction 77, result has 34.2 percent of original size [2022-12-14 09:02:56,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 54 [2022-12-14 09:02:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 21 not checked. [2022-12-14 09:02:56,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:02:56,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124345484] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:02:56,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1921778627] [2022-12-14 09:02:56,664 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-12-14 09:02:56,664 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:02:56,665 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 09:02:56,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:02:56,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 26 [2022-12-14 09:02:56,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284338430] [2022-12-14 09:02:56,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:02:56,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 09:02:56,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:02:56,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 09:02:56,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=523, Unknown=3, NotChecked=144, Total=756 [2022-12-14 09:02:56,667 INFO L87 Difference]: Start difference. First operand 265 states and 307 transitions. Second operand has 27 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 23 states have internal predecessors, (64), 11 states have call successors, (11), 4 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 09:03:02,825 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 09:03:03,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:03:03,762 INFO L93 Difference]: Finished difference Result 279 states and 324 transitions. [2022-12-14 09:03:03,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 09:03:03,763 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 23 states have internal predecessors, (64), 11 states have call successors, (11), 4 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 09:03:03,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:03:03,764 INFO L225 Difference]: With dead ends: 279 [2022-12-14 09:03:03,764 INFO L226 Difference]: Without dead ends: 279 [2022-12-14 09:03:03,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=265, Invalid=1814, Unknown=3, NotChecked=270, Total=2352 [2022-12-14 09:03:03,765 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 197 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 2019 mSolverCounterSat, 72 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2019 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 738 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-12-14 09:03:03,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1345 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2019 Invalid, 23 Unknown, 738 Unchecked, 5.3s Time] [2022-12-14 09:03:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-12-14 09:03:03,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 267. [2022-12-14 09:03:03,768 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 09:03:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 311 transitions. [2022-12-14 09:03:03,768 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 311 transitions. Word has length 62 [2022-12-14 09:03:03,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:03:03,769 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 311 transitions. [2022-12-14 09:03:03,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 23 states have internal predecessors, (64), 11 states have call successors, (11), 4 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 09:03:03,769 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 311 transitions. [2022-12-14 09:03:03,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-14 09:03:03,770 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:03,770 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 09:03:03,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 09:03:03,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:03:03,972 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 09:03:03,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:03,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1803047484, now seen corresponding path program 1 times [2022-12-14 09:03:03,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:03:03,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191292940] [2022-12-14 09:03:03,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:03,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:03:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 5 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:03:08,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:03:08,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191292940] [2022-12-14 09:03:08,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191292940] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:03:08,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256145514] [2022-12-14 09:03:08,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:08,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:03:08,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:03:08,118 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:03:08,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 09:03:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:03:08,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 09:03:08,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:03:08,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 5 treesize of output 3 [2022-12-14 09:03:08,672 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 09:03:08,746 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_4023 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4023) |c_#length|)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-14 09:03:22,969 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_4024 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4024) |c_#length|)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-14 09:03:40,000 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_4025 Int)) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4025))) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-14 09:04:00,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:04:00,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:04:00,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:04:00,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:04:00,840 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-14 09:04:00,841 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 09:04:00,854 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 09:04:00,854 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 09:04:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 25 not checked. [2022-12-14 09:04:00,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:04:09,252 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 09:04:09,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256145514] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:04:09,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2145516340] [2022-12-14 09:04:09,254 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-12-14 09:04:09,254 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:04:09,255 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 09:04:09,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:04:09,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 17] total 53 [2022-12-14 09:04:09,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907846688] [2022-12-14 09:04:09,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:04:09,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-14 09:04:09,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:04:09,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-14 09:04:09,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2411, Unknown=28, NotChecked=306, Total=2970 [2022-12-14 09:04:09,256 INFO L87 Difference]: Start difference. First operand 267 states and 311 transitions. Second operand has 54 states, 47 states have (on average 2.021276595744681) internal successors, (95), 45 states have internal predecessors, (95), 14 states have call successors, (14), 9 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 09:04:11,295 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 09:04:13,302 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 09:04:15,305 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 09:04:23,562 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 09:04:25,568 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 09:04:40,848 WARN L233 SmtUtils]: Spent 8.61s on a formula simplification. DAG size of input: 47 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:04:47,448 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 09:05:01,304 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 09:05:10,904 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 09:05:37,504 WARN L233 SmtUtils]: Spent 5.31s on a formula simplification. DAG size of input: 127 DAG size of output: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:05:45,322 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 09:05:47,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:05:47,352 INFO L93 Difference]: Finished difference Result 277 states and 320 transitions. [2022-12-14 09:05:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 09:05:47,353 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 47 states have (on average 2.021276595744681) internal successors, (95), 45 states have internal predecessors, (95), 14 states have call successors, (14), 9 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 09:05:47,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:05:47,354 INFO L225 Difference]: With dead ends: 277 [2022-12-14 09:05:47,354 INFO L226 Difference]: Without dead ends: 277 [2022-12-14 09:05:47,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1398 ImplicationChecksByTransitivity, 138.5s TimeCoverageRelationStatistics Valid=737, Invalid=5713, Unknown=42, NotChecked=480, Total=6972 [2022-12-14 09:05:47,357 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 437 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 2834 mSolverCounterSat, 129 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 3679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2834 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 707 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2022-12-14 09:05:47,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1525 Invalid, 3679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2834 Invalid, 9 Unknown, 707 Unchecked, 21.9s Time] [2022-12-14 09:05:47,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-12-14 09:05:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 263. [2022-12-14 09:05:47,360 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 09:05:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 305 transitions. [2022-12-14 09:05:47,360 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 305 transitions. Word has length 62 [2022-12-14 09:05:47,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:05:47,361 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 305 transitions. [2022-12-14 09:05:47,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 47 states have (on average 2.021276595744681) internal successors, (95), 45 states have internal predecessors, (95), 14 states have call successors, (14), 9 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 09:05:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 305 transitions. [2022-12-14 09:05:47,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-14 09:05:47,362 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:05:47,362 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 09:05:47,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-14 09:05:47,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-14 09:05:47,562 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 09:05:47,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:05:47,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1152447770, now seen corresponding path program 1 times [2022-12-14 09:05:47,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:05:47,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840236410] [2022-12-14 09:05:47,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:05:47,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:05:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:05:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 153 proven. 46 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 09:05:52,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:05:52,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840236410] [2022-12-14 09:05:52,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840236410] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:05:52,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031689034] [2022-12-14 09:05:52,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:05:52,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:05:52,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:05:52,282 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:05:52,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 09:05:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:05:52,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 147 conjunts are in the unsatisfiable core [2022-12-14 09:05:52,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:05:52,596 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 09:05:52,652 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 09:05:52,842 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 09:05:52,972 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 41 treesize of output 25 [2022-12-14 09:05:52,985 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-14 09:05:52,985 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 3 case distinctions, treesize of input 26 treesize of output 16 [2022-12-14 09:05:52,988 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 11 treesize of output 7 [2022-12-14 09:05:53,244 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 41 treesize of output 25 [2022-12-14 09:05:53,369 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-14 09:05:53,370 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 09:05:53,577 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 09:05:53,803 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-14 09:05:53,803 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 09:05:54,042 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (v_ArrVal_4588 (Array Int Int))) (and (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~next~0#1.base| (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_4588) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)) (< |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| 1)))) is different from true [2022-12-14 09:05:54,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:05:54,147 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 24 [2022-12-14 09:05:54,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:05:54,677 INFO L321 Elim1Store]: treesize reduction 268, result has 14.9 percent of original size [2022-12-14 09:05:54,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 66 treesize of output 93 [2022-12-14 09:05:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 142 proven. 48 refuted. 0 times theorem prover too weak. 33 trivial. 8 not checked. [2022-12-14 09:05:54,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:05:55,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:05:55,638 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 09:05:55,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:05:55,643 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 57 treesize of output 45 [2022-12-14 09:05:55,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031689034] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:05:55,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1692196952] [2022-12-14 09:05:55,758 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-12-14 09:05:55,758 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:05:55,759 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 09:05:55,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:05:55,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32] total 59 [2022-12-14 09:05:55,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703745414] [2022-12-14 09:05:55,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:05:55,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-12-14 09:05:55,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:05:55,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-12-14 09:05:55,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=3249, Unknown=9, NotChecked=116, Total=3660 [2022-12-14 09:05:55,761 INFO L87 Difference]: Start difference. First operand 263 states and 305 transitions. Second operand has 60 states, 55 states have (on average 2.290909090909091) internal successors, (126), 56 states have internal predecessors, (126), 11 states have call successors, (16), 3 states have call predecessors, (16), 11 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2022-12-14 09:05:58,560 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 09:06:14,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:06:14,985 INFO L93 Difference]: Finished difference Result 300 states and 354 transitions. [2022-12-14 09:06:14,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 09:06:14,986 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 55 states have (on average 2.290909090909091) internal successors, (126), 56 states have internal predecessors, (126), 11 states have call successors, (16), 3 states have call predecessors, (16), 11 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) Word has length 124 [2022-12-14 09:06:14,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:06:14,987 INFO L225 Difference]: With dead ends: 300 [2022-12-14 09:06:14,987 INFO L226 Difference]: Without dead ends: 300 [2022-12-14 09:06:14,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2095 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=766, Invalid=6526, Unknown=22, NotChecked=168, Total=7482 [2022-12-14 09:06:14,988 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 338 mSDsluCounter, 2110 mSDsCounter, 0 mSdLazyCounter, 5581 mSolverCounterSat, 101 mSolverCounterUnsat, 49 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 5993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 5581 IncrementalHoareTripleChecker+Invalid, 49 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-12-14 09:06:14,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 2241 Invalid, 5993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 5581 Invalid, 49 Unknown, 262 Unchecked, 10.8s Time] [2022-12-14 09:06:14,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-12-14 09:06:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 272. [2022-12-14 09:06:14,991 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 09:06:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 320 transitions. [2022-12-14 09:06:14,992 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 320 transitions. Word has length 124 [2022-12-14 09:06:14,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:06:14,992 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 320 transitions. [2022-12-14 09:06:14,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 55 states have (on average 2.290909090909091) internal successors, (126), 56 states have internal predecessors, (126), 11 states have call successors, (16), 3 states have call predecessors, (16), 11 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2022-12-14 09:06:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 320 transitions. [2022-12-14 09:06:14,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 09:06:14,992 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:06:14,993 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-12-14 09:06:14,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 09:06:15,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-14 09:06:15,194 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 09:06:15,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:06:15,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1505564894, now seen corresponding path program 2 times [2022-12-14 09:06:15,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:06:15,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512979405] [2022-12-14 09:06:15,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:06:15,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:06:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:06:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 33 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-14 09:06:17,710 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:06:17,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512979405] [2022-12-14 09:06:17,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512979405] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:06:17,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690018806] [2022-12-14 09:06:17,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 09:06:17,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:06:17,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:06:17,712 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:06:17,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 09:06:20,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 09:06:20,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:06:20,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 120 conjunts are in the unsatisfiable core [2022-12-14 09:06:20,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:06:20,782 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 09:06:20,873 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 09:06:20,876 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 09:06:21,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:21,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2022-12-14 09:06:21,101 INFO L321 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-12-14 09:06:21,102 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 21 treesize of output 13 [2022-12-14 09:06:21,105 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 11 treesize of output 7 [2022-12-14 09:06:21,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:21,456 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:06:21,456 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 19 treesize of output 15 [2022-12-14 09:06:21,782 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 09:06:22,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,117 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-12-14 09:06:22,117 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 34 [2022-12-14 09:06:22,122 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 09:06:22,517 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 69 treesize of output 53 [2022-12-14 09:06:22,548 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4947 Int) (v_ArrVal_4957 Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_336| Int) (|dll_create_generic_~#dll~0.base| Int) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (v_ArrVal_4953 Int) (v_ArrVal_4950 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_227 Int)) (let ((.cse0 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| 1))) (let ((.cse2 (store .cse0 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_336| 1))) (let ((.cse1 (store .cse2 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| 1))) (and (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_336|) 0) (< |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select (store .cse1 v_arrayElimCell_227 1) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (= (select .cse1 v_arrayElimCell_227) 0) (< v_arrayElimCell_227 |c_#StackHeapBarrier|) (= (select .cse2 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 0) (= (store (store (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_4947) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_336| v_DerPreprocessor_3) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_4950) v_arrayElimCell_227 v_ArrVal_4953) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4957) |c_#length|)))))) is different from true [2022-12-14 09:06:22,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2022-12-14 09:06:22,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:22,797 INFO L321 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-12-14 09:06:22,797 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 54 treesize of output 60 [2022-12-14 09:06:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 43 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2022-12-14 09:06:22,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:06:25,951 WARN L837 $PredicateComparison]: unable to prove that (and (or (forall ((|v_dll_create_generic_~#dll~0.base_197| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_385| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_386| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_356| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_357| Int)) (let ((.cse2 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_197| 1))) (let ((.cse1 (store .cse2 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_386| 1))) (let ((.cse0 (store .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_357| 1))) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_385| |c_#StackHeapBarrier|)) (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_197|)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_356| |c_#StackHeapBarrier|)) (not (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_356|) 0)) (not (= (select (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_356| 1) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_385|) 0)) (not (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_357|) 0)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_357| |c_#StackHeapBarrier|)) (not (= (select .cse2 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_386|) 0))))))) (<= 0 (+ |c_dll_insert_master_~item~1#1.offset| 8))) (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_357| Int)) (or (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_356| Int)) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_356| |c_#StackHeapBarrier|)) (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_385| Int)) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_385| |c_#StackHeapBarrier|)) (forall ((|v_dll_create_generic_~#dll~0.base_197| Int)) (or (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_197|)) (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_386| Int)) (let ((.cse5 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_197| 1))) (let ((.cse4 (store .cse5 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_386| 1))) (let ((.cse3 (store .cse4 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_357| 1))) (or (not (= (select .cse3 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_356|) 0)) (forall ((v_ArrVal_5019 Int) (v_ArrVal_5018 Int) (v_ArrVal_5017 Int) (v_ArrVal_5016 Int) (v_ArrVal_5015 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_197| v_ArrVal_5018) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_386| v_ArrVal_5019) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_357| v_ArrVal_5015) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_356| v_ArrVal_5016) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_385| v_ArrVal_5017) |c_dll_insert_master_~item~1#1.base|))) (not (= (select (store .cse3 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_356| 1) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_385|) 0)) (not (= (select .cse4 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_357|) 0)) (not (= (select .cse5 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_386|) 0))))))))))))) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_357| |c_#StackHeapBarrier|))))) is different from false [2022-12-14 09:06:25,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690018806] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:06:25,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1093918764] [2022-12-14 09:06:25,956 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 09:06:25,956 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:06:25,956 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 09:06:25,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:06:25,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 28] total 40 [2022-12-14 09:06:25,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519623172] [2022-12-14 09:06:25,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:06:25,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-14 09:06:25,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:06:25,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-14 09:06:25,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1439, Unknown=4, NotChecked=158, Total=1806 [2022-12-14 09:06:25,958 INFO L87 Difference]: Start difference. First operand 272 states and 320 transitions. Second operand has 41 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 12 states have call successors, (14), 3 states have call predecessors, (14), 8 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-12-14 09:06:31,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:06:31,724 INFO L93 Difference]: Finished difference Result 279 states and 329 transitions. [2022-12-14 09:06:31,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 09:06:31,725 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 12 states have call successors, (14), 3 states have call predecessors, (14), 8 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 75 [2022-12-14 09:06:31,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:06:31,725 INFO L225 Difference]: With dead ends: 279 [2022-12-14 09:06:31,726 INFO L226 Difference]: Without dead ends: 279 [2022-12-14 09:06:31,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=369, Invalid=2602, Unknown=7, NotChecked=214, Total=3192 [2022-12-14 09:06:31,726 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 240 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 3086 mSolverCounterSat, 78 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 3423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 3086 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-12-14 09:06:31,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 980 Invalid, 3423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 3086 Invalid, 5 Unknown, 254 Unchecked, 3.4s Time] [2022-12-14 09:06:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-12-14 09:06:31,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 272. [2022-12-14 09:06:31,729 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 09:06:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 318 transitions. [2022-12-14 09:06:31,730 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 318 transitions. Word has length 75 [2022-12-14 09:06:31,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:06:31,730 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 318 transitions. [2022-12-14 09:06:31,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 12 states have call successors, (14), 3 states have call predecessors, (14), 8 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-12-14 09:06:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 318 transitions. [2022-12-14 09:06:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-14 09:06:31,730 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:06:31,731 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 09:06:31,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 09:06:31,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:06:31,932 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 09:06:31,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:06:31,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1366161642, now seen corresponding path program 1 times [2022-12-14 09:06:31,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:06:31,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555169492] [2022-12-14 09:06:31,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:06:31,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:06:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:06:34,211 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 09:06:34,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:06:34,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555169492] [2022-12-14 09:06:34,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555169492] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:06:34,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373576604] [2022-12-14 09:06:34,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:06:34,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:06:34,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:06:34,212 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:06:34,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 09:06:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:06:34,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-14 09:06:34,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:06:34,633 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 09:06:34,664 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 09:06:34,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:34,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:34,773 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 11 treesize of output 7 [2022-12-14 09:06:34,780 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_5550 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5550))))) is different from true [2022-12-14 09:06:34,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:34,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:34,913 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 11 treesize of output 7 [2022-12-14 09:06:35,020 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 09:06:35,023 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5551 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_5551))) is different from true [2022-12-14 09:06:39,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:39,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:39,174 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 11 treesize of output 7 [2022-12-14 09:06:39,393 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5554 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_5554))) (exists ((v_ArrVal_5556 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset| Int)) (and (= |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_5556) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|)) (<= |##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset| |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) (<= 0 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|))) (< |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|)) is different from true [2022-12-14 09:06:39,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:39,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:06:39,573 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 32 treesize of output 24 [2022-12-14 09:06:40,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:40,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:40,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:40,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:40,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:40,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:40,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:40,079 INFO L321 Elim1Store]: treesize reduction 119, result has 29.2 percent of original size [2022-12-14 09:06:40,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 80 [2022-12-14 09:06:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 141 proven. 36 refuted. 0 times theorem prover too weak. 23 trivial. 32 not checked. [2022-12-14 09:06:40,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:06:40,886 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:06:40,887 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 09:06:40,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:06:40,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:06:40,896 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 57 treesize of output 45 [2022-12-14 09:06:41,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373576604] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:06:41,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1286736048] [2022-12-14 09:06:41,009 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-12-14 09:06:41,009 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:06:41,009 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 09:06:41,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:06:41,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 29] total 38 [2022-12-14 09:06:41,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765750998] [2022-12-14 09:06:41,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:06:41,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 09:06:41,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:06:41,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 09:06:41,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1198, Unknown=7, NotChecked=216, Total=1560 [2022-12-14 09:06:41,010 INFO L87 Difference]: Start difference. First operand 272 states and 318 transitions. Second operand has 39 states, 33 states have (on average 3.272727272727273) internal successors, (108), 34 states have internal predecessors, (108), 13 states have call successors, (19), 5 states have call predecessors, (19), 8 states have return successors, (18), 14 states have call predecessors, (18), 12 states have call successors, (18) [2022-12-14 09:06:47,235 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 09:06:49,507 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 09:06:57,422 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 09:07:03,059 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 09:07:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:07:05,135 INFO L93 Difference]: Finished difference Result 286 states and 336 transitions. [2022-12-14 09:07:05,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 09:07:05,136 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 33 states have (on average 3.272727272727273) internal successors, (108), 34 states have internal predecessors, (108), 13 states have call successors, (19), 5 states have call predecessors, (19), 8 states have return successors, (18), 14 states have call predecessors, (18), 12 states have call successors, (18) Word has length 125 [2022-12-14 09:07:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:07:05,137 INFO L225 Difference]: With dead ends: 286 [2022-12-14 09:07:05,137 INFO L226 Difference]: Without dead ends: 286 [2022-12-14 09:07:05,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=371, Invalid=3171, Unknown=10, NotChecked=354, Total=3906 [2022-12-14 09:07:05,137 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 226 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 3069 mSolverCounterSat, 66 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 3921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3069 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 771 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2022-12-14 09:07:05,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1618 Invalid, 3921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3069 Invalid, 15 Unknown, 771 Unchecked, 14.3s Time] [2022-12-14 09:07:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-12-14 09:07:05,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 274. [2022-12-14 09:07:05,140 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 09:07:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 322 transitions. [2022-12-14 09:07:05,141 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 322 transitions. Word has length 125 [2022-12-14 09:07:05,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:07:05,141 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 322 transitions. [2022-12-14 09:07:05,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 33 states have (on average 3.272727272727273) internal successors, (108), 34 states have internal predecessors, (108), 13 states have call successors, (19), 5 states have call predecessors, (19), 8 states have return successors, (18), 14 states have call predecessors, (18), 12 states have call successors, (18) [2022-12-14 09:07:05,141 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 322 transitions. [2022-12-14 09:07:05,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-14 09:07:05,142 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:07:05,142 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 09:07:05,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-14 09:07:05,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:07:05,343 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 09:07:05,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:07:05,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1366161643, now seen corresponding path program 1 times [2022-12-14 09:07:05,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:07:05,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471948472] [2022-12-14 09:07:05,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:07:05,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:07:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:07:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-14 09:07:08,670 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:07:08,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471948472] [2022-12-14 09:07:08,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471948472] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:07:08,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490022026] [2022-12-14 09:07:08,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:07:08,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:07:08,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:07:08,672 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:07:08,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 09:07:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:07:09,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-14 09:07:09,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:07:09,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:09,420 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 09:07:09,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:09,648 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 11 treesize of output 7 [2022-12-14 09:07:09,654 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 09:07:09,709 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 09:07:09,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:09,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:09,864 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 11 treesize of output 7 [2022-12-14 09:07:09,869 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_6145 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6145) |c_#length|)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-14 09:07:10,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:10,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:10,030 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 11 treesize of output 7 [2022-12-14 09:07:10,036 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_6146 Int)) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6146))) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-14 09:07:12,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:12,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:12,232 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 11 treesize of output 7 [2022-12-14 09:07:12,272 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_6147 Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6147) |c_#length|))) is different from true [2022-12-14 09:07:24,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:24,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:24,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:24,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:24,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:24,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:24,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:24,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:24,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:24,208 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-14 09:07:24,208 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 3 case distinctions, treesize of input 26 treesize of output 57 [2022-12-14 09:07:24,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:24,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:24,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:24,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:24,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:24,237 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-14 09:07:24,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2022-12-14 09:07:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 117 proven. 41 refuted. 0 times theorem prover too weak. 17 trivial. 57 not checked. [2022-12-14 09:07:24,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:07:32,864 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:07:32,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490022026] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:07:32,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [93859605] [2022-12-14 09:07:32,866 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-12-14 09:07:32,866 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:07:32,866 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 09:07:32,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:07:32,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 45 [2022-12-14 09:07:32,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902930199] [2022-12-14 09:07:32,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:07:32,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-14 09:07:32,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:07:32,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-14 09:07:32,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1724, Unknown=5, NotChecked=258, Total=2162 [2022-12-14 09:07:32,867 INFO L87 Difference]: Start difference. First operand 274 states and 322 transitions. Second operand has 46 states, 37 states have (on average 3.972972972972973) internal successors, (147), 39 states have internal predecessors, (147), 19 states have call successors, (25), 7 states have call predecessors, (25), 12 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-12-14 09:07:35,757 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 09:07:37,928 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 09:07:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:07:52,019 INFO L93 Difference]: Finished difference Result 275 states and 322 transitions. [2022-12-14 09:07:52,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 09:07:52,020 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 37 states have (on average 3.972972972972973) internal successors, (147), 39 states have internal predecessors, (147), 19 states have call successors, (25), 7 states have call predecessors, (25), 12 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) Word has length 125 [2022-12-14 09:07:52,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:07:52,021 INFO L225 Difference]: With dead ends: 275 [2022-12-14 09:07:52,021 INFO L226 Difference]: Without dead ends: 275 [2022-12-14 09:07:52,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=370, Invalid=3173, Unknown=9, NotChecked=354, Total=3906 [2022-12-14 09:07:52,021 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 431 mSDsluCounter, 2044 mSDsCounter, 0 mSdLazyCounter, 3539 mSolverCounterSat, 153 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 4458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 3539 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 754 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:07:52,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 2182 Invalid, 4458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 3539 Invalid, 12 Unknown, 754 Unchecked, 7.2s Time] [2022-12-14 09:07:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-12-14 09:07:52,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 266. [2022-12-14 09:07:52,024 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 09:07:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 310 transitions. [2022-12-14 09:07:52,025 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 310 transitions. Word has length 125 [2022-12-14 09:07:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:07:52,025 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 310 transitions. [2022-12-14 09:07:52,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 37 states have (on average 3.972972972972973) internal successors, (147), 39 states have internal predecessors, (147), 19 states have call successors, (25), 7 states have call predecessors, (25), 12 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-12-14 09:07:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 310 transitions. [2022-12-14 09:07:52,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 09:07:52,026 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:07:52,026 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 09:07:52,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 09:07:52,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-14 09:07:52,227 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 09:07:52,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:07:52,228 INFO L85 PathProgramCache]: Analyzing trace with hash -292698616, now seen corresponding path program 1 times [2022-12-14 09:07:52,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:07:52,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425495898] [2022-12-14 09:07:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:07:52,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:07:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:07:52,621 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 09:07:52,621 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:07:52,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425495898] [2022-12-14 09:07:52,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425495898] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:07:52,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877625888] [2022-12-14 09:07:52,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:07:52,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:07:52,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:07:52,622 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:07:52,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 09:07:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:07:52,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 09:07:52,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:07:52,995 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 09:07:53,027 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 09:07:53,035 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 09:07:53,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:07:53,272 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 09:07:53,283 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 09:07:53,380 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 09:07:53,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877625888] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:07:53,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1327537485] [2022-12-14 09:07:53,382 INFO L159 IcfgInterpreter]: Started Sifa with 42 locations of interest [2022-12-14 09:07:53,382 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:07:53,382 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 09:07:53,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:07:53,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 15 [2022-12-14 09:07:53,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102137405] [2022-12-14 09:07:53,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:07:53,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 09:07:53,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:07:53,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 09:07:53,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-12-14 09:07:53,384 INFO L87 Difference]: Start difference. First operand 266 states and 310 transitions. Second operand has 15 states, 11 states have (on average 4.545454545454546) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2022-12-14 09:07:53,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:07:53,943 INFO L93 Difference]: Finished difference Result 366 states and 422 transitions. [2022-12-14 09:07:53,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 09:07:53,943 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 4.545454545454546) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) Word has length 109 [2022-12-14 09:07:53,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:07:53,945 INFO L225 Difference]: With dead ends: 366 [2022-12-14 09:07:53,945 INFO L226 Difference]: Without dead ends: 366 [2022-12-14 09:07:53,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 217 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 09:07:53,946 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 153 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 09:07:53,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 2134 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 09:07:53,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-12-14 09:07:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 291. [2022-12-14 09:07:53,951 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 09:07:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 358 transitions. [2022-12-14 09:07:53,952 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 358 transitions. Word has length 109 [2022-12-14 09:07:53,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:07:53,953 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 358 transitions. [2022-12-14 09:07:53,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 4.545454545454546) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2022-12-14 09:07:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 358 transitions. [2022-12-14 09:07:53,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 09:07:53,954 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:07:53,954 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 09:07:53,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-14 09:07:54,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-14 09:07:54,154 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 09:07:54,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:07:54,155 INFO L85 PathProgramCache]: Analyzing trace with hash -292710234, now seen corresponding path program 1 times [2022-12-14 09:07:54,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:07:54,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799046924] [2022-12-14 09:07:54,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:07:54,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:07:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:07:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-14 09:07:54,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:07:54,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799046924] [2022-12-14 09:07:54,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799046924] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:07:54,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088850487] [2022-12-14 09:07:54,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:07:54,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:07:54,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:07:54,835 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:07:54,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 09:07:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:07:55,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 09:07:55,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:07:55,371 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 09:07:55,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:07:55,476 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 09:07:55,478 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 09:07:55,512 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 09:07:55,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:07:55,835 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 09:07:55,946 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 09:07:55,954 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 09:07:55,955 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 09:07:56,039 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 09:07:56,054 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 09:07:56,134 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 09:07:56,298 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 09:07:56,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088850487] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:07:56,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [535555189] [2022-12-14 09:07:56,299 INFO L159 IcfgInterpreter]: Started Sifa with 42 locations of interest [2022-12-14 09:07:56,299 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:07:56,299 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 09:07:56,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:07:56,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 35 [2022-12-14 09:07:56,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274111408] [2022-12-14 09:07:56,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:07:56,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 09:07:56,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:07:56,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 09:07:56,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1165, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 09:07:56,301 INFO L87 Difference]: Start difference. First operand 291 states and 358 transitions. Second operand has 36 states, 25 states have (on average 3.52) internal successors, (88), 32 states have internal predecessors, (88), 13 states have call successors, (20), 3 states have call predecessors, (20), 11 states have return successors, (21), 15 states have call predecessors, (21), 12 states have call successors, (21) [2022-12-14 09:07:58,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:07:58,463 INFO L93 Difference]: Finished difference Result 304 states and 353 transitions. [2022-12-14 09:07:58,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 09:07:58,463 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 25 states have (on average 3.52) internal successors, (88), 32 states have internal predecessors, (88), 13 states have call successors, (20), 3 states have call predecessors, (20), 11 states have return successors, (21), 15 states have call predecessors, (21), 12 states have call successors, (21) Word has length 109 [2022-12-14 09:07:58,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:07:58,464 INFO L225 Difference]: With dead ends: 304 [2022-12-14 09:07:58,464 INFO L226 Difference]: Without dead ends: 304 [2022-12-14 09:07:58,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 208 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 09:07:58,465 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 345 mSDsluCounter, 2078 mSDsCounter, 0 mSdLazyCounter, 3913 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 3996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 09:07:58,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 2198 Invalid, 3996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3913 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 09:07:58,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-12-14 09:07:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 286. [2022-12-14 09:07:58,467 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 09:07:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 348 transitions. [2022-12-14 09:07:58,468 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 348 transitions. Word has length 109 [2022-12-14 09:07:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:07:58,468 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 348 transitions. [2022-12-14 09:07:58,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 25 states have (on average 3.52) internal successors, (88), 32 states have internal predecessors, (88), 13 states have call successors, (20), 3 states have call predecessors, (20), 11 states have return successors, (21), 15 states have call predecessors, (21), 12 states have call successors, (21) [2022-12-14 09:07:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 348 transitions. [2022-12-14 09:07:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 09:07:58,469 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:07:58,469 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 09:07:58,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-14 09:07:58,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-14 09:07:58,671 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 09:07:58,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:07:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash -292710233, now seen corresponding path program 1 times [2022-12-14 09:07:58,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:07:58,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282807315] [2022-12-14 09:07:58,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:07:58,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:07:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:07:59,432 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 09:07:59,432 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:07:59,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282807315] [2022-12-14 09:07:59,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282807315] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:07:59,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894807670] [2022-12-14 09:07:59,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:07:59,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:07:59,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:07:59,434 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:07:59,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 09:07:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:07:59,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-14 09:07:59,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:07:59,875 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 09:07:59,878 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 09:07:59,921 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 09:07:59,924 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 09:07:59,942 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 09:07:59,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:08:00,549 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 09:08:00,552 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 09:08:00,558 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:08:00,559 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 09:08:00,603 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 09:08:00,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:08:00,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:08:00,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:08:00,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:08:00,648 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 09:08:00,795 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 09:08:00,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894807670] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:08:00,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1033867089] [2022-12-14 09:08:00,796 INFO L159 IcfgInterpreter]: Started Sifa with 42 locations of interest [2022-12-14 09:08:00,796 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:08:00,796 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 09:08:00,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:08:00,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 27 [2022-12-14 09:08:00,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085963031] [2022-12-14 09:08:00,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:08:00,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 09:08:00,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:08:00,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 09:08:00,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-12-14 09:08:00,798 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 09:08:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:08:01,846 INFO L93 Difference]: Finished difference Result 346 states and 402 transitions. [2022-12-14 09:08:01,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 09:08:01,846 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 09:08:01,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:08:01,847 INFO L225 Difference]: With dead ends: 346 [2022-12-14 09:08:01,847 INFO L226 Difference]: Without dead ends: 346 [2022-12-14 09:08:01,847 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 09:08:01,848 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 244 mSDsluCounter, 2183 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 2338 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 09:08:01,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 2338 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 09:08:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-12-14 09:08:01,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 308. [2022-12-14 09:08:01,851 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 09:08:01,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 391 transitions. [2022-12-14 09:08:01,851 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 391 transitions. Word has length 109 [2022-12-14 09:08:01,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:08:01,851 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 391 transitions. [2022-12-14 09:08:01,852 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 09:08:01,852 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 391 transitions. [2022-12-14 09:08:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-12-14 09:08:01,852 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:08:01,852 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, 1, 1, 1] [2022-12-14 09:08:01,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-14 09:08:02,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:08:02,054 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 09:08:02,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:08:02,055 INFO L85 PathProgramCache]: Analyzing trace with hash -111293000, now seen corresponding path program 1 times [2022-12-14 09:08:02,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:08:02,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169787648] [2022-12-14 09:08:02,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:08:02,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:08:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:08:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-12-14 09:08:03,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:08:03,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169787648] [2022-12-14 09:08:03,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169787648] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:08:03,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221956810] [2022-12-14 09:08:03,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:08:03,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:08:03,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:08:03,176 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:08:03,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 09:08:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:08:03,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 1307 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-14 09:08:03,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:08:03,657 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 09:08:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 33 proven. 32 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-12-14 09:08:08,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:08:08,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221956810] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:08:08,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [200978270] [2022-12-14 09:08:08,389 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2022-12-14 09:08:08,389 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:08:08,390 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 09:08:08,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:08:08,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 36 [2022-12-14 09:08:08,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223933922] [2022-12-14 09:08:08,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:08:08,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 09:08:08,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:08:08,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 09:08:08,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1230, Unknown=9, NotChecked=0, Total=1332 [2022-12-14 09:08:08,392 INFO L87 Difference]: Start difference. First operand 308 states and 391 transitions. Second operand has 36 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 30 states have internal predecessors, (75), 12 states have call successors, (17), 5 states have call predecessors, (17), 11 states have return successors, (17), 13 states have call predecessors, (17), 10 states have call successors, (17) [2022-12-14 09:08:10,557 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 09:08:14,631 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 09:08:16,705 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 09:08:29,215 WARN L233 SmtUtils]: Spent 8.06s 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 09:08:31,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 09:08:33,610 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 09:08:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:08:35,258 INFO L93 Difference]: Finished difference Result 312 states and 390 transitions. [2022-12-14 09:08:35,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 09:08:35,258 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 30 states have internal predecessors, (75), 12 states have call successors, (17), 5 states have call predecessors, (17), 11 states have return successors, (17), 13 states have call predecessors, (17), 10 states have call successors, (17) Word has length 126 [2022-12-14 09:08:35,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:08:35,260 INFO L225 Difference]: With dead ends: 312 [2022-12-14 09:08:35,260 INFO L226 Difference]: Without dead ends: 312 [2022-12-14 09:08:35,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=238, Invalid=2597, Unknown=27, NotChecked=0, Total=2862 [2022-12-14 09:08:35,260 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 168 mSDsluCounter, 3182 mSDsCounter, 0 mSdLazyCounter, 4339 mSolverCounterSat, 60 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 3321 SdHoareTripleChecker+Invalid, 4430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 4339 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:08:35,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 3321 Invalid, 4430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 4339 Invalid, 31 Unknown, 0 Unchecked, 12.1s Time] [2022-12-14 09:08:35,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-12-14 09:08:35,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 301. [2022-12-14 09:08:35,264 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 09:08:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 380 transitions. [2022-12-14 09:08:35,264 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 380 transitions. Word has length 126 [2022-12-14 09:08:35,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:08:35,265 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 380 transitions. [2022-12-14 09:08:35,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 30 states have internal predecessors, (75), 12 states have call successors, (17), 5 states have call predecessors, (17), 11 states have return successors, (17), 13 states have call predecessors, (17), 10 states have call successors, (17) [2022-12-14 09:08:35,265 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 380 transitions. [2022-12-14 09:08:35,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 09:08:35,265 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:08:35,265 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 09:08:35,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-14 09:08:35,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d40c1d50-3600-45a9-a7fc-56e66b9044ff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-14 09:08:35,467 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 09:08:35,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:08:35,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1195740055, now seen corresponding path program 1 times [2022-12-14 09:08:35,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:08:35,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574946623] [2022-12-14 09:08:35,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:08:35,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:08:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat