./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 6b4ec56b 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_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 20:56:07,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:56:07,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:56:07,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:56:07,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:56:07,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:56:07,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:56:07,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:56:07,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:56:07,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:56:07,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:56:07,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:56:07,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:56:07,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:56:07,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:56:07,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:56:07,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:56:07,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:56:07,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:56:07,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:56:07,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:56:07,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:56:07,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:56:07,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:56:07,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:56:07,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:56:07,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:56:07,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:56:07,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:56:07,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:56:07,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:56:07,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:56:07,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:56:07,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:56:07,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:56:07,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:56:07,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:56:07,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:56:07,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:56:07,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:56:07,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:56:07,115 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-11-20 20:56:07,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:56:07,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:56:07,143 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:56:07,143 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:56:07,144 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:56:07,144 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:56:07,144 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:56:07,145 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:56:07,145 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:56:07,145 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:56:07,146 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:56:07,146 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:56:07,146 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:56:07,147 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:56:07,147 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:56:07,147 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:56:07,147 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:56:07,147 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:56:07,148 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 20:56:07,148 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 20:56:07,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:56:07,149 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:56:07,149 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 20:56:07,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:56:07,149 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:56:07,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:56:07,150 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 20:56:07,150 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 20:56:07,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:56:07,151 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 20:56:07,151 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:56:07,151 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:56:07,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:56:07,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:56:07,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:56:07,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:56:07,152 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:56:07,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:56:07,152 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:56:07,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:56:07,153 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:56:07,153 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_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/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_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 [2022-11-20 20:56:07,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:56:07,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:56:07,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:56:07,462 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:56:07,462 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:56:07,463 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2022-11-20 20:56:10,523 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:56:10,876 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:56:10,877 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2022-11-20 20:56:10,889 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/data/d50a7d9aa/5eff3ef8aa134c06859f203026da8122/FLAGaaded235b [2022-11-20 20:56:10,910 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/data/d50a7d9aa/5eff3ef8aa134c06859f203026da8122 [2022-11-20 20:56:10,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:56:10,917 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:56:10,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:56:10,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:56:10,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:56:10,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:56:10" (1/1) ... [2022-11-20 20:56:10,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17d69813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:10, skipping insertion in model container [2022-11-20 20:56:10,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:56:10" (1/1) ... [2022-11-20 20:56:10,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:56:10,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:56:11,242 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_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2022-11-20 20:56:11,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:56:11,293 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:56:11,323 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_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2022-11-20 20:56:11,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:56:11,368 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:56:11,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:11 WrapperNode [2022-11-20 20:56:11,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:56:11,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:56:11,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:56:11,370 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:56:11,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:11" (1/1) ... [2022-11-20 20:56:11,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:11" (1/1) ... [2022-11-20 20:56:11,422 INFO L138 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 234 [2022-11-20 20:56:11,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:56:11,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:56:11,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:56:11,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:56:11,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:11" (1/1) ... [2022-11-20 20:56:11,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:11" (1/1) ... [2022-11-20 20:56:11,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:11" (1/1) ... [2022-11-20 20:56:11,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:11" (1/1) ... [2022-11-20 20:56:11,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:11" (1/1) ... [2022-11-20 20:56:11,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:11" (1/1) ... [2022-11-20 20:56:11,491 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:11" (1/1) ... [2022-11-20 20:56:11,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:11" (1/1) ... [2022-11-20 20:56:11,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:56:11,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:56:11,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:56:11,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:56:11,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:11" (1/1) ... [2022-11-20 20:56:11,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:56:11,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:56:11,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:56:11,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:56:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-11-20 20:56:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-11-20 20:56:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2022-11-20 20:56:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2022-11-20 20:56:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 20:56:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:56:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2022-11-20 20:56:11,582 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2022-11-20 20:56:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 20:56:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 20:56:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-20 20:56:11,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-20 20:56:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 20:56:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 20:56:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 20:56:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2022-11-20 20:56:11,583 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2022-11-20 20:56:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2022-11-20 20:56:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2022-11-20 20:56:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 20:56:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:56:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:56:11,724 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:56:11,726 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:56:12,613 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:56:12,744 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:56:12,767 INFO L300 CfgBuilder]: Removed 38 assume(true) statements. [2022-11-20 20:56:12,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:56:12 BoogieIcfgContainer [2022-11-20 20:56:12,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:56:12,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:56:12,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:56:12,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:56:12,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:56:10" (1/3) ... [2022-11-20 20:56:12,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10678b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:56:12, skipping insertion in model container [2022-11-20 20:56:12,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:56:11" (2/3) ... [2022-11-20 20:56:12,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10678b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:56:12, skipping insertion in model container [2022-11-20 20:56:12,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:56:12" (3/3) ... [2022-11-20 20:56:12,780 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2022-11-20 20:56:12,815 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:56:12,815 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2022-11-20 20:56:12,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:56:12,904 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;@702399b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:56:12,904 INFO L358 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2022-11-20 20:56:12,909 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-11-20 20:56:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 20:56:12,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:12,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:12,922 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-11-20 20:56:12,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:12,933 INFO L85 PathProgramCache]: Analyzing trace with hash 691826204, now seen corresponding path program 1 times [2022-11-20 20:56:12,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:12,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455930410] [2022-11-20 20:56:12,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:12,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:13,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:13,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455930410] [2022-11-20 20:56:13,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455930410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:13,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:13,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:56:13,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855737508] [2022-11-20 20:56:13,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:13,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:56:13,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:13,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:56:13,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:56:13,368 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-11-20 20:56:13,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:13,723 INFO L93 Difference]: Finished difference Result 231 states and 263 transitions. [2022-11-20 20:56:13,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:56:13,729 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-11-20 20:56:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:13,752 INFO L225 Difference]: With dead ends: 231 [2022-11-20 20:56:13,752 INFO L226 Difference]: Without dead ends: 230 [2022-11-20 20:56:13,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:56:13,760 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 19 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:13,761 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.3s Time] [2022-11-20 20:56:13,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-20 20:56:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2022-11-20 20:56:13,808 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-11-20 20:56:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 258 transitions. [2022-11-20 20:56:13,812 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 258 transitions. Word has length 7 [2022-11-20 20:56:13,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:13,813 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 258 transitions. [2022-11-20 20:56:13,813 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-11-20 20:56:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 258 transitions. [2022-11-20 20:56:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 20:56:13,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:13,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:13,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 20:56:13,815 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-11-20 20:56:13,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:13,816 INFO L85 PathProgramCache]: Analyzing trace with hash 691826205, now seen corresponding path program 1 times [2022-11-20 20:56:13,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:13,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138738498] [2022-11-20 20:56:13,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:13,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:14,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:14,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138738498] [2022-11-20 20:56:14,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138738498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:14,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:14,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:56:14,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660959122] [2022-11-20 20:56:14,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:14,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:56:14,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:14,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:56:14,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:56:14,038 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-11-20 20:56:14,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:14,301 INFO L93 Difference]: Finished difference Result 228 states and 260 transitions. [2022-11-20 20:56:14,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:56:14,303 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-11-20 20:56:14,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:14,313 INFO L225 Difference]: With dead ends: 228 [2022-11-20 20:56:14,313 INFO L226 Difference]: Without dead ends: 228 [2022-11-20 20:56:14,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:56:14,315 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 17 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:14,315 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.2s Time] [2022-11-20 20:56:14,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-20 20:56:14,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2022-11-20 20:56:14,345 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-11-20 20:56:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 256 transitions. [2022-11-20 20:56:14,347 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 256 transitions. Word has length 7 [2022-11-20 20:56:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:14,347 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 256 transitions. [2022-11-20 20:56:14,348 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-11-20 20:56:14,348 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 256 transitions. [2022-11-20 20:56:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 20:56:14,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:14,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:14,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 20:56:14,349 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-11-20 20:56:14,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:14,350 INFO L85 PathProgramCache]: Analyzing trace with hash -892161265, now seen corresponding path program 1 times [2022-11-20 20:56:14,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:14,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538718893] [2022-11-20 20:56:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:14,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:14,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:14,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538718893] [2022-11-20 20:56:14,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538718893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:14,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:14,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:56:14,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997151159] [2022-11-20 20:56:14,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:14,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:56:14,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:14,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:56:14,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:56:14,412 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-11-20 20:56:14,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:14,595 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2022-11-20 20:56:14,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:56:14,596 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-11-20 20:56:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:14,597 INFO L225 Difference]: With dead ends: 223 [2022-11-20 20:56:14,597 INFO L226 Difference]: Without dead ends: 223 [2022-11-20 20:56:14,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:56:14,599 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:14,600 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.2s Time] [2022-11-20 20:56:14,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-20 20:56:14,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2022-11-20 20:56:14,609 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-11-20 20:56:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2022-11-20 20:56:14,611 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 9 [2022-11-20 20:56:14,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:14,611 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2022-11-20 20:56:14,611 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-11-20 20:56:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2022-11-20 20:56:14,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 20:56:14,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:14,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:14,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 20:56:14,613 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-11-20 20:56:14,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:14,613 INFO L85 PathProgramCache]: Analyzing trace with hash -892161264, now seen corresponding path program 1 times [2022-11-20 20:56:14,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:14,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853504657] [2022-11-20 20:56:14,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:14,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:14,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:14,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853504657] [2022-11-20 20:56:14,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853504657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:14,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:14,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:56:14,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603691924] [2022-11-20 20:56:14,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:14,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:56:14,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:14,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:56:14,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:56:14,683 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-11-20 20:56:14,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:14,845 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2022-11-20 20:56:14,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:56:14,846 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-11-20 20:56:14,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:14,847 INFO L225 Difference]: With dead ends: 220 [2022-11-20 20:56:14,847 INFO L226 Difference]: Without dead ends: 220 [2022-11-20 20:56:14,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:56:14,849 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-11-20 20:56:14,849 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-11-20 20:56:14,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-20 20:56:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-11-20 20:56:14,856 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-11-20 20:56:14,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 250 transitions. [2022-11-20 20:56:14,858 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 250 transitions. Word has length 9 [2022-11-20 20:56:14,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:14,858 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 250 transitions. [2022-11-20 20:56:14,858 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-11-20 20:56:14,859 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 250 transitions. [2022-11-20 20:56:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 20:56:14,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:14,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:14,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 20:56:14,860 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-11-20 20:56:14,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:14,860 INFO L85 PathProgramCache]: Analyzing trace with hash -874929520, now seen corresponding path program 1 times [2022-11-20 20:56:14,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:14,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799106330] [2022-11-20 20:56:14,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:14,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:15,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:15,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799106330] [2022-11-20 20:56:15,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799106330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:15,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:15,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:56:15,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246206929] [2022-11-20 20:56:15,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:15,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:56:15,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:15,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:56:15,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:56:15,119 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-11-20 20:56:15,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:15,337 INFO L93 Difference]: Finished difference Result 242 states and 280 transitions. [2022-11-20 20:56:15,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:56:15,339 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-11-20 20:56:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:15,341 INFO L225 Difference]: With dead ends: 242 [2022-11-20 20:56:15,341 INFO L226 Difference]: Without dead ends: 242 [2022-11-20 20:56:15,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:56:15,342 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:15,343 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.2s Time] [2022-11-20 20:56:15,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-20 20:56:15,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236. [2022-11-20 20:56:15,351 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-11-20 20:56:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 276 transitions. [2022-11-20 20:56:15,352 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 276 transitions. Word has length 9 [2022-11-20 20:56:15,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:15,353 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 276 transitions. [2022-11-20 20:56:15,353 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-11-20 20:56:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 276 transitions. [2022-11-20 20:56:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 20:56:15,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:15,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:15,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 20:56:15,354 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-11-20 20:56:15,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:15,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1118615216, now seen corresponding path program 1 times [2022-11-20 20:56:15,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:15,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030021592] [2022-11-20 20:56:15,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:15,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:15,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:15,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030021592] [2022-11-20 20:56:15,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030021592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:15,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:15,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 20:56:15,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666397457] [2022-11-20 20:56:15,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:15,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 20:56:15,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:15,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 20:56:15,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 20:56:15,577 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-11-20 20:56:16,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:16,038 INFO L93 Difference]: Finished difference Result 255 states and 298 transitions. [2022-11-20 20:56:16,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 20:56:16,038 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-11-20 20:56:16,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:16,040 INFO L225 Difference]: With dead ends: 255 [2022-11-20 20:56:16,040 INFO L226 Difference]: Without dead ends: 255 [2022-11-20 20:56:16,040 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-11-20 20:56:16,041 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 92 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 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.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:16,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 866 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 20:56:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-20 20:56:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 245. [2022-11-20 20:56:16,049 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-11-20 20:56:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 288 transitions. [2022-11-20 20:56:16,050 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 288 transitions. Word has length 12 [2022-11-20 20:56:16,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:16,050 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 288 transitions. [2022-11-20 20:56:16,050 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-11-20 20:56:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 288 transitions. [2022-11-20 20:56:16,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 20:56:16,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:16,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:16,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 20:56:16,052 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-11-20 20:56:16,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:16,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1118615215, now seen corresponding path program 1 times [2022-11-20 20:56:16,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:16,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705910772] [2022-11-20 20:56:16,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:16,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:16,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:16,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705910772] [2022-11-20 20:56:16,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705910772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:16,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:16,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 20:56:16,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215945083] [2022-11-20 20:56:16,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:16,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 20:56:16,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:16,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 20:56:16,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:56:16,448 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-11-20 20:56:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:17,103 INFO L93 Difference]: Finished difference Result 253 states and 296 transitions. [2022-11-20 20:56:17,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:56:17,105 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-11-20 20:56:17,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:17,107 INFO L225 Difference]: With dead ends: 253 [2022-11-20 20:56:17,107 INFO L226 Difference]: Without dead ends: 253 [2022-11-20 20:56:17,107 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-11-20 20:56:17,108 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 60 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:17,108 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.6s Time] [2022-11-20 20:56:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-20 20:56:17,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 245. [2022-11-20 20:56:17,120 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-11-20 20:56:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 286 transitions. [2022-11-20 20:56:17,121 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 286 transitions. Word has length 12 [2022-11-20 20:56:17,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:17,122 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 286 transitions. [2022-11-20 20:56:17,122 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-11-20 20:56:17,122 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 286 transitions. [2022-11-20 20:56:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 20:56:17,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:17,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:17,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 20:56:17,124 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-11-20 20:56:17,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:17,125 INFO L85 PathProgramCache]: Analyzing trace with hash -317313492, now seen corresponding path program 1 times [2022-11-20 20:56:17,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:17,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389524639] [2022-11-20 20:56:17,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:17,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:17,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:17,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389524639] [2022-11-20 20:56:17,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389524639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:17,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:17,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:56:17,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345666706] [2022-11-20 20:56:17,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:17,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:56:17,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:17,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:56:17,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:56:17,240 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-11-20 20:56:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:17,477 INFO L93 Difference]: Finished difference Result 244 states and 285 transitions. [2022-11-20 20:56:17,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:56:17,478 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-11-20 20:56:17,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:17,480 INFO L225 Difference]: With dead ends: 244 [2022-11-20 20:56:17,480 INFO L226 Difference]: Without dead ends: 244 [2022-11-20 20:56:17,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:56:17,481 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 23 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:17,481 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.2s Time] [2022-11-20 20:56:17,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-11-20 20:56:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-11-20 20:56:17,490 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-11-20 20:56:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 285 transitions. [2022-11-20 20:56:17,492 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 285 transitions. Word has length 13 [2022-11-20 20:56:17,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:17,492 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 285 transitions. [2022-11-20 20:56:17,493 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-11-20 20:56:17,493 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 285 transitions. [2022-11-20 20:56:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 20:56:17,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:17,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:17,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 20:56:17,494 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-11-20 20:56:17,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:17,495 INFO L85 PathProgramCache]: Analyzing trace with hash -317313491, now seen corresponding path program 1 times [2022-11-20 20:56:17,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:17,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065569701] [2022-11-20 20:56:17,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:17,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:17,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:17,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065569701] [2022-11-20 20:56:17,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065569701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:17,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:17,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:56:17,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548887957] [2022-11-20 20:56:17,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:17,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:56:17,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:17,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:56:17,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:56:17,603 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-11-20 20:56:17,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:17,799 INFO L93 Difference]: Finished difference Result 243 states and 284 transitions. [2022-11-20 20:56:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:56:17,800 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-11-20 20:56:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:17,801 INFO L225 Difference]: With dead ends: 243 [2022-11-20 20:56:17,801 INFO L226 Difference]: Without dead ends: 243 [2022-11-20 20:56:17,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:56:17,802 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:17,803 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.2s Time] [2022-11-20 20:56:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-20 20:56:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2022-11-20 20:56:17,813 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-11-20 20:56:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 284 transitions. [2022-11-20 20:56:17,820 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 284 transitions. Word has length 13 [2022-11-20 20:56:17,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:17,821 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 284 transitions. [2022-11-20 20:56:17,821 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-11-20 20:56:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 284 transitions. [2022-11-20 20:56:17,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 20:56:17,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:17,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:17,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 20:56:17,824 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-11-20 20:56:17,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash 4412237, now seen corresponding path program 1 times [2022-11-20 20:56:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:17,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865210355] [2022-11-20 20:56:17,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:17,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:18,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:18,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:18,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865210355] [2022-11-20 20:56:18,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865210355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:18,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:18,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 20:56:18,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069435441] [2022-11-20 20:56:18,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:18,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 20:56:18,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:18,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 20:56:18,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-20 20:56:18,342 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-11-20 20:56:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:18,985 INFO L93 Difference]: Finished difference Result 270 states and 316 transitions. [2022-11-20 20:56:18,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 20:56:18,986 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-11-20 20:56:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:18,988 INFO L225 Difference]: With dead ends: 270 [2022-11-20 20:56:18,988 INFO L226 Difference]: Without dead ends: 270 [2022-11-20 20:56:18,988 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-11-20 20:56:18,989 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 23 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:18,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1326 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 20:56:18,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-20 20:56:18,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 257. [2022-11-20 20:56:19,000 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-11-20 20:56:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2022-11-20 20:56:19,002 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 15 [2022-11-20 20:56:19,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:19,002 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2022-11-20 20:56:19,003 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-11-20 20:56:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2022-11-20 20:56:19,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 20:56:19,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:19,004 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-11-20 20:56:19,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 20:56:19,004 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-11-20 20:56:19,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:19,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2063600924, now seen corresponding path program 1 times [2022-11-20 20:56:19,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:19,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044031246] [2022-11-20 20:56:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:19,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:56:19,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:19,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044031246] [2022-11-20 20:56:19,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044031246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:19,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:19,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:56:19,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305147897] [2022-11-20 20:56:19,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:19,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:56:19,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:19,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:56:19,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:56:19,400 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-11-20 20:56:19,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:19,887 INFO L93 Difference]: Finished difference Result 255 states and 304 transitions. [2022-11-20 20:56:19,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:56:19,888 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-11-20 20:56:19,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:19,889 INFO L225 Difference]: With dead ends: 255 [2022-11-20 20:56:19,889 INFO L226 Difference]: Without dead ends: 255 [2022-11-20 20:56:19,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-20 20:56:19,890 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 49 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:19,890 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.4s Time] [2022-11-20 20:56:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-20 20:56:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-11-20 20:56:19,897 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-11-20 20:56:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 304 transitions. [2022-11-20 20:56:19,899 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 304 transitions. Word has length 23 [2022-11-20 20:56:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:19,900 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 304 transitions. [2022-11-20 20:56:19,900 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-11-20 20:56:19,900 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 304 transitions. [2022-11-20 20:56:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 20:56:19,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:19,901 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-11-20 20:56:19,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 20:56:19,901 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-11-20 20:56:19,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:19,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2063600923, now seen corresponding path program 1 times [2022-11-20 20:56:19,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:19,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026238186] [2022-11-20 20:56:19,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:19,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:20,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:56:20,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:20,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026238186] [2022-11-20 20:56:20,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026238186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:20,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:20,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 20:56:20,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216741813] [2022-11-20 20:56:20,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:20,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 20:56:20,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:20,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 20:56:20,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:56:20,102 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-11-20 20:56:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:20,507 INFO L93 Difference]: Finished difference Result 253 states and 302 transitions. [2022-11-20 20:56:20,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:56:20,508 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-11-20 20:56:20,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:20,509 INFO L225 Difference]: With dead ends: 253 [2022-11-20 20:56:20,509 INFO L226 Difference]: Without dead ends: 253 [2022-11-20 20:56:20,510 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-11-20 20:56:20,510 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 45 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 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.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:20,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 874 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 20:56:20,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-20 20:56:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2022-11-20 20:56:20,518 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-11-20 20:56:20,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 302 transitions. [2022-11-20 20:56:20,520 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 302 transitions. Word has length 23 [2022-11-20 20:56:20,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:20,520 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 302 transitions. [2022-11-20 20:56:20,520 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-11-20 20:56:20,520 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 302 transitions. [2022-11-20 20:56:20,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 20:56:20,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:20,521 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-11-20 20:56:20,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 20:56:20,521 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-11-20 20:56:20,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:20,522 INFO L85 PathProgramCache]: Analyzing trace with hash -452863182, now seen corresponding path program 1 times [2022-11-20 20:56:20,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:20,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520202962] [2022-11-20 20:56:20,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:20,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:20,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:56:20,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:20,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520202962] [2022-11-20 20:56:20,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520202962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:20,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:20,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:56:20,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245022111] [2022-11-20 20:56:20,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:20,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:56:20,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:20,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:56:20,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:56:20,644 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-11-20 20:56:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:20,859 INFO L93 Difference]: Finished difference Result 252 states and 301 transitions. [2022-11-20 20:56:20,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:56:20,860 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-11-20 20:56:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:20,861 INFO L225 Difference]: With dead ends: 252 [2022-11-20 20:56:20,862 INFO L226 Difference]: Without dead ends: 252 [2022-11-20 20:56:20,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:56:20,862 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 20 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:20,863 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.2s Time] [2022-11-20 20:56:20,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-20 20:56:20,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2022-11-20 20:56:20,872 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-11-20 20:56:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 301 transitions. [2022-11-20 20:56:20,874 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 301 transitions. Word has length 24 [2022-11-20 20:56:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:20,875 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 301 transitions. [2022-11-20 20:56:20,876 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-11-20 20:56:20,876 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 301 transitions. [2022-11-20 20:56:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 20:56:20,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:20,877 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-11-20 20:56:20,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 20:56:20,877 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-11-20 20:56:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:20,878 INFO L85 PathProgramCache]: Analyzing trace with hash -452863181, now seen corresponding path program 1 times [2022-11-20 20:56:20,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:20,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401140536] [2022-11-20 20:56:20,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:20,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:21,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:56:21,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:21,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401140536] [2022-11-20 20:56:21,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401140536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:21,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:21,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:56:21,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733168411] [2022-11-20 20:56:21,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:21,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:56:21,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:21,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:56:21,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:56:21,064 INFO L87 Difference]: Start difference. First operand 252 states and 301 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:21,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:21,300 INFO L93 Difference]: Finished difference Result 251 states and 300 transitions. [2022-11-20 20:56:21,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:56:21,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 20:56:21,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:21,302 INFO L225 Difference]: With dead ends: 251 [2022-11-20 20:56:21,302 INFO L226 Difference]: Without dead ends: 251 [2022-11-20 20:56:21,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:56:21,303 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 19 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:21,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 687 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:56:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-20 20:56:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-11-20 20:56:21,312 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-11-20 20:56:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 300 transitions. [2022-11-20 20:56:21,314 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 300 transitions. Word has length 24 [2022-11-20 20:56:21,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:21,315 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 300 transitions. [2022-11-20 20:56:21,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:21,315 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 300 transitions. [2022-11-20 20:56:21,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 20:56:21,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:21,320 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-11-20 20:56:21,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 20:56:21,321 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-11-20 20:56:21,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:21,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1409818669, now seen corresponding path program 1 times [2022-11-20 20:56:21,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:21,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301684925] [2022-11-20 20:56:21,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:21,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:56:21,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:21,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301684925] [2022-11-20 20:56:21,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301684925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:21,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:21,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 20:56:21,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835846612] [2022-11-20 20:56:21,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:21,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 20:56:21,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:21,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 20:56:21,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 20:56:21,799 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-11-20 20:56:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:22,330 INFO L93 Difference]: Finished difference Result 260 states and 310 transitions. [2022-11-20 20:56:22,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 20:56:22,332 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-11-20 20:56:22,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:22,334 INFO L225 Difference]: With dead ends: 260 [2022-11-20 20:56:22,334 INFO L226 Difference]: Without dead ends: 260 [2022-11-20 20:56:22,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-20 20:56:22,335 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 15 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:22,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1002 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 20:56:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-20 20:56:22,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2022-11-20 20:56:22,346 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-11-20 20:56:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 309 transitions. [2022-11-20 20:56:22,348 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 309 transitions. Word has length 26 [2022-11-20 20:56:22,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:22,348 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 309 transitions. [2022-11-20 20:56:22,349 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-11-20 20:56:22,349 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 309 transitions. [2022-11-20 20:56:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 20:56:22,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:22,353 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-11-20 20:56:22,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 20:56:22,354 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-11-20 20:56:22,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:22,354 INFO L85 PathProgramCache]: Analyzing trace with hash -143384194, now seen corresponding path program 1 times [2022-11-20 20:56:22,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:22,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135288320] [2022-11-20 20:56:22,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:22,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:56:23,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:23,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135288320] [2022-11-20 20:56:23,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135288320] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:56:23,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682492771] [2022-11-20 20:56:23,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:23,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:23,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:56:23,125 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:56:23,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 20:56:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:23,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-20 20:56:23,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:23,503 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-11-20 20:56:23,578 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-11-20 20:56:23,716 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:56:23,717 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-11-20 20:56:23,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:23,765 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-11-20 20:56:23,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:23,788 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-11-20 20:56:23,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 20:56:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 20:56:23,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:56:24,084 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| Int) (v_ArrVal_532 (Array Int Int))) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| 1) (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| v_ArrVal_532) |c_##fun~$Pointer$~TO~VOID_#~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#~10#1.offset|)) 1))) is different from false [2022-11-20 20:56:24,102 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| Int) (v_ArrVal_532 (Array Int Int))) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| 1) (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| v_ArrVal_532) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)) 1))) is different from false [2022-11-20 20:56:24,118 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| Int) (v_ArrVal_532 (Array Int Int))) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| 1) (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_18| v_ArrVal_532) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|)) 1))) is different from false [2022-11-20 20:56:24,244 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:24,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-20 20:56:24,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2022-11-20 20:56:24,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-11-20 20:56:24,263 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-11-20 20:56:24,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:24,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-20 20:56:24,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:56:24,382 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:24,382 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-11-20 20:56:33,609 WARN L233 SmtUtils]: Spent 9.14s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:56:41,865 WARN L233 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:56:41,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-11-20 20:56:41,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-11-20 20:56:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-11-20 20:56:41,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682492771] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:56:41,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [173800611] [2022-11-20 20:56:42,013 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-20 20:56:42,013 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:56:42,018 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 20:56:42,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:56:42,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 30 [2022-11-20 20:56:42,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249331604] [2022-11-20 20:56:42,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:56:42,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-20 20:56:42,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:42,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-20 20:56:42,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=684, Unknown=3, NotChecked=162, Total=930 [2022-11-20 20:56:42,027 INFO L87 Difference]: Start difference. First operand 259 states and 309 transitions. Second operand has 31 states, 25 states have (on average 2.2) internal successors, (55), 26 states have internal predecessors, (55), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:56:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:45,583 INFO L93 Difference]: Finished difference Result 275 states and 327 transitions. [2022-11-20 20:56:45,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 20:56:45,584 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 2.2) internal successors, (55), 26 states have internal predecessors, (55), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-11-20 20:56:45,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:45,585 INFO L225 Difference]: With dead ends: 275 [2022-11-20 20:56:45,585 INFO L226 Difference]: Without dead ends: 275 [2022-11-20 20:56:45,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=268, Invalid=1301, Unknown=3, NotChecked=234, Total=1806 [2022-11-20 20:56:45,587 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 173 mSDsluCounter, 2172 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 918 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:45,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 2372 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 992 Invalid, 0 Unknown, 918 Unchecked, 0.8s Time] [2022-11-20 20:56:45,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-20 20:56:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 270. [2022-11-20 20:56:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 148 states have (on average 1.7905405405405406) internal successors, (265), 245 states have internal predecessors, (265), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (24), 14 states have call predecessors, (24), 18 states have call successors, (24) [2022-11-20 20:56:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 321 transitions. [2022-11-20 20:56:45,599 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 321 transitions. Word has length 37 [2022-11-20 20:56:45,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:45,599 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 321 transitions. [2022-11-20 20:56:45,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 2.2) internal successors, (55), 26 states have internal predecessors, (55), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:56:45,600 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 321 transitions. [2022-11-20 20:56:45,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 20:56:45,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:45,601 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-11-20 20:56:45,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 20:56:45,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 20:56:45,809 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-11-20 20:56:45,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:45,810 INFO L85 PathProgramCache]: Analyzing trace with hash -143384193, now seen corresponding path program 1 times [2022-11-20 20:56:45,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:45,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251116962] [2022-11-20 20:56:45,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:45,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:56:46,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:46,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251116962] [2022-11-20 20:56:46,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251116962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:56:46,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629219913] [2022-11-20 20:56:46,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:46,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:46,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:56:46,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:56:46,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 20:56:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:47,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-20 20:56:47,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:47,145 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-11-20 20:56:47,157 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-11-20 20:56:47,286 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-11-20 20:56:47,292 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-11-20 20:56:47,505 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 20:56:47,505 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-11-20 20:56:47,513 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-11-20 20:56:47,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:47,571 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-11-20 20:56:47,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:47,582 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-11-20 20:56:47,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:47,641 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-11-20 20:56:47,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:47,655 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-11-20 20:56:47,737 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-11-20 20:56:47,740 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-11-20 20:56:47,790 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 20:56:47,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:56:47,893 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_697) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_698) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|)))) (forall ((v_ArrVal_697 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_697) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|) 4)))) is different from false [2022-11-20 20:56:51,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:51,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 93 [2022-11-20 20:56:51,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 116 [2022-11-20 20:56:51,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 230 [2022-11-20 20:56:51,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:51,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 183 [2022-11-20 20:56:51,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 248 [2022-11-20 20:56:51,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 209 [2022-11-20 20:56:51,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 197 [2022-11-20 20:56:51,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:51,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 202 [2022-11-20 20:56:51,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 191 [2022-11-20 20:56:52,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:52,381 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-11-20 20:56:52,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:52,390 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-11-20 20:56:52,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:56:52,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:52,407 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-11-20 20:56:52,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:56:52,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:52,424 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-11-20 20:56:52,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:52,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-20 20:56:52,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:56:52,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:52,494 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-11-20 20:57:06,697 WARN L233 SmtUtils]: Spent 14.11s 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-11-20 20:57:11,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:57:11,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 52 [2022-11-20 20:57:11,152 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-20 20:57:11,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629219913] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:57:11,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1354279021] [2022-11-20 20:57:11,155 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-20 20:57:11,156 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:57:11,156 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 20:57:11,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:57:11,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2022-11-20 20:57:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821080005] [2022-11-20 20:57:11,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:57:11,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 20:57:11,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:57:11,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 20:57:11,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=908, Unknown=2, NotChecked=60, Total=1056 [2022-11-20 20:57:11,160 INFO L87 Difference]: Start difference. First operand 270 states and 321 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-11-20 20:57:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:14,579 INFO L93 Difference]: Finished difference Result 273 states and 324 transitions. [2022-11-20 20:57:14,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 20:57:14,579 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-11-20 20:57:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:14,581 INFO L225 Difference]: With dead ends: 273 [2022-11-20 20:57:14,581 INFO L226 Difference]: Without dead ends: 273 [2022-11-20 20:57:14,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=399, Invalid=1955, Unknown=2, NotChecked=94, Total=2450 [2022-11-20 20:57:14,583 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 148 mSDsluCounter, 2603 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 2804 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1098 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:14,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 2804 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1578 Invalid, 0 Unknown, 1098 Unchecked, 1.4s Time] [2022-11-20 20:57:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-11-20 20:57:14,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 269. [2022-11-20 20:57:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 148 states have (on average 1.777027027027027) internal successors, (263), 244 states have internal predecessors, (263), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-20 20:57:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 318 transitions. [2022-11-20 20:57:14,592 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 318 transitions. Word has length 37 [2022-11-20 20:57:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:14,593 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 318 transitions. [2022-11-20 20:57:14,593 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-11-20 20:57:14,593 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 318 transitions. [2022-11-20 20:57:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 20:57:14,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:14,594 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-11-20 20:57:14,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:14,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 20:57:14,801 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-11-20 20:57:14,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:14,802 INFO L85 PathProgramCache]: Analyzing trace with hash -835158194, now seen corresponding path program 1 times [2022-11-20 20:57:14,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:57:14,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754436215] [2022-11-20 20:57:14,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:14,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:57:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 20:57:14,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:57:14,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754436215] [2022-11-20 20:57:14,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754436215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:57:14,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:57:14,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:57:14,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544669287] [2022-11-20 20:57:14,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:57:14,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:57:14,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:57:14,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:57:14,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:57:14,971 INFO L87 Difference]: Start difference. First operand 269 states and 318 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-11-20 20:57:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:15,143 INFO L93 Difference]: Finished difference Result 258 states and 294 transitions. [2022-11-20 20:57:15,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:57:15,144 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-11-20 20:57:15,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:15,146 INFO L225 Difference]: With dead ends: 258 [2022-11-20 20:57:15,146 INFO L226 Difference]: Without dead ends: 258 [2022-11-20 20:57:15,146 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-11-20 20:57:15,147 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 20 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 805 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-11-20 20:57:15,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 805 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:57:15,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-20 20:57:15,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-11-20 20:57:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 140 states have (on average 1.7785714285714285) internal successors, (249), 236 states have internal predecessors, (249), 29 states have call successors, (29), 12 states have call predecessors, (29), 10 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2022-11-20 20:57:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 294 transitions. [2022-11-20 20:57:15,161 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 294 transitions. Word has length 40 [2022-11-20 20:57:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:15,161 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 294 transitions. [2022-11-20 20:57:15,161 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-11-20 20:57:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 294 transitions. [2022-11-20 20:57:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 20:57:15,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:15,163 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-11-20 20:57:15,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 20:57:15,164 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-11-20 20:57:15,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:15,164 INFO L85 PathProgramCache]: Analyzing trace with hash 54211896, now seen corresponding path program 1 times [2022-11-20 20:57:15,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:57:15,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669407943] [2022-11-20 20:57:15,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:15,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:57:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:57:16,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:57:16,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669407943] [2022-11-20 20:57:16,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669407943] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:57:16,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933139852] [2022-11-20 20:57:16,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:16,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:57:16,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:57:16,071 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:57:16,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 20:57:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:16,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-20 20:57:16,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:16,328 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-11-20 20:57:16,564 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-11-20 20:57:16,642 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-11-20 20:57:16,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2022-11-20 20:57:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:57:23,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:57:23,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933139852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:57:23,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1844619127] [2022-11-20 20:57:23,932 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-11-20 20:57:23,933 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:57:23,933 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 20:57:23,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:57:23,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2022-11-20 20:57:23,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612958790] [2022-11-20 20:57:23,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:57:23,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-20 20:57:23,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:57:23,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-20 20:57:23,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=832, Unknown=11, NotChecked=0, Total=930 [2022-11-20 20:57:23,935 INFO L87 Difference]: Start difference. First operand 258 states and 294 transitions. Second operand has 30 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 20:57:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:31,949 INFO L93 Difference]: Finished difference Result 264 states and 299 transitions. [2022-11-20 20:57:31,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 20:57:31,950 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-11-20 20:57:31,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:31,951 INFO L225 Difference]: With dead ends: 264 [2022-11-20 20:57:31,951 INFO L226 Difference]: Without dead ends: 261 [2022-11-20 20:57:31,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=168, Invalid=1454, Unknown=18, NotChecked=0, Total=1640 [2022-11-20 20:57:31,953 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 113 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 821 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:31,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 2206 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1597 Invalid, 0 Unknown, 821 Unchecked, 1.4s Time] [2022-11-20 20:57:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-20 20:57:31,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2022-11-20 20:57:31,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 140 states have (on average 1.7714285714285714) internal successors, (248), 236 states have internal predecessors, (248), 29 states have call successors, (29), 12 states have call predecessors, (29), 10 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2022-11-20 20:57:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 293 transitions. [2022-11-20 20:57:31,962 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 293 transitions. Word has length 46 [2022-11-20 20:57:31,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:31,964 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 293 transitions. [2022-11-20 20:57:31,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 20:57:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 293 transitions. [2022-11-20 20:57:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 20:57:31,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:31,965 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-11-20 20:57:31,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:32,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:57:32,172 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-11-20 20:57:32,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:32,172 INFO L85 PathProgramCache]: Analyzing trace with hash -750347739, now seen corresponding path program 1 times [2022-11-20 20:57:32,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:57:32,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696256099] [2022-11-20 20:57:32,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:32,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:57:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:34,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:57:34,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696256099] [2022-11-20 20:57:34,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696256099] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:57:34,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636679898] [2022-11-20 20:57:34,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:34,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:57:34,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:57:34,779 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:57:34,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 20:57:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:35,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-20 20:57:35,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:35,039 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-11-20 20:57:35,194 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-11-20 20:57:35,208 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1172 Int)) (= |c_#valid| (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1172))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-11-20 20:57:35,371 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1172 Int) (v_ArrVal_1173 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (let ((.cse0 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1172))) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1173)) (= (select .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0)))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-11-20 20:57:35,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:35,383 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-11-20 20:57:35,393 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-11-20 20:57:35,432 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1172 Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| Int) (v_ArrVal_1173 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (let ((.cse0 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1172))) (and (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47|) 0) (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| |c_#StackHeapBarrier|) (= |c_#valid| (store (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| v_ArrVal_1173) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-11-20 20:57:35,486 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1172 Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| Int) (v_ArrVal_1173 Int) (v_ArrVal_1175 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_dll_create_generic_~#dll~0.base_43| Int)) (let ((.cse0 (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_43| v_ArrVal_1172))) (and (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47|) 0) (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| |c_#StackHeapBarrier|) (= |c_#valid| (store (store (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| v_ArrVal_1173) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_43| v_ArrVal_1175)) (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_43|)))) is different from true [2022-11-20 20:57:35,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:35,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:35,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:35,602 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-20 20:57:35,602 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-11-20 20:57:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2022-11-20 20:57:35,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:57:35,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636679898] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:57:35,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1398482498] [2022-11-20 20:57:35,915 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-11-20 20:57:35,915 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:57:35,915 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 20:57:35,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:57:35,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11] total 30 [2022-11-20 20:57:35,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468274623] [2022-11-20 20:57:35,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:57:35,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-20 20:57:35,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:57:35,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-20 20:57:35,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=628, Unknown=5, NotChecked=270, Total=992 [2022-11-20 20:57:35,918 INFO L87 Difference]: Start difference. First operand 258 states and 293 transitions. Second operand has 31 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 28 states have internal predecessors, (66), 8 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-20 20:58:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:58:04,692 INFO L93 Difference]: Finished difference Result 274 states and 316 transitions. [2022-11-20 20:58:04,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 20:58:04,692 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 28 states have internal predecessors, (66), 8 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 47 [2022-11-20 20:58:04,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:58:04,695 INFO L225 Difference]: With dead ends: 274 [2022-11-20 20:58:04,696 INFO L226 Difference]: Without dead ends: 274 [2022-11-20 20:58:04,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=215, Invalid=1858, Unknown=17, NotChecked=460, Total=2550 [2022-11-20 20:58:04,698 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 165 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 3414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1311 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:58:04,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1182 Invalid, 3414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2057 Invalid, 0 Unknown, 1311 Unchecked, 2.5s Time] [2022-11-20 20:58:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-20 20:58:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 266. [2022-11-20 20:58:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 146 states have (on average 1.7602739726027397) internal successors, (257), 240 states have internal predecessors, (257), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-20 20:58:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 305 transitions. [2022-11-20 20:58:04,714 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 305 transitions. Word has length 47 [2022-11-20 20:58:04,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:58:04,714 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 305 transitions. [2022-11-20 20:58:04,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 28 states have internal predecessors, (66), 8 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-20 20:58:04,715 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 305 transitions. [2022-11-20 20:58:04,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 20:58:04,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:58:04,715 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-11-20 20:58:04,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 20:58:04,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:58:04,923 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-11-20 20:58:04,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:58:04,923 INFO L85 PathProgramCache]: Analyzing trace with hash -750347738, now seen corresponding path program 1 times [2022-11-20 20:58:04,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:58:04,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595532485] [2022-11-20 20:58:04,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:58:04,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:58:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:58:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 20:58:06,229 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:58:06,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595532485] [2022-11-20 20:58:06,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595532485] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:58:06,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885905781] [2022-11-20 20:58:06,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:58:06,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:58:06,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:58:06,231 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:58:06,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 20:58:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:58:06,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-20 20:58:06,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:58:06,508 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-11-20 20:58:06,646 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-11-20 20:58:06,651 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-11-20 20:58:06,668 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1377 Int)) (= (store |c_old(#length)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1377) |c_#length|)) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|) (exists ((v_ArrVal_1378 Int)) (= |c_#valid| (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1378)))) is different from true [2022-11-20 20:58:07,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:07,011 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-11-20 20:58:07,177 WARN L859 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_~#dll~0.base| Int)) (and (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|) (exists ((v_ArrVal_1380 Int) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_1378 Int) (v_ArrVal_1377 Int) (v_ArrVal_1379 Int)) (let ((.cse1 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_1378))) (let ((.cse0 (store .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1379))) (and (= (select .cse0 |dll_create_generic_~#dll~0.base|) 1) (= (select .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select .cse0 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 0) (= (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_1377) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1380) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| (select |c_#length| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|)) |c_#length|))))))) is different from true [2022-11-20 20:58:07,292 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1380 Int) (|dll_create_generic_~#dll~0.base| Int) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_1378 Int) (v_ArrVal_1377 Int) (v_ArrVal_1379 Int)) (let ((.cse1 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_1378))) (let ((.cse0 (store .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1379))) (and (= (select .cse0 |dll_create_generic_~#dll~0.base|) 1) (= (select .cse1 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select .cse0 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 0) (= (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_1377) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1380) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| (select |c_#length| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|)) |c_#length|))))) is different from true [2022-11-20 20:58:07,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:07,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:07,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:07,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:07,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:07,374 INFO L321 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-11-20 20:58:07,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 25 [2022-11-20 20:58:07,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:07,413 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-20 20:58:07,414 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-11-20 20:58:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 20:58:07,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:58:12,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885905781] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:58:12,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1613439097] [2022-11-20 20:58:12,231 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-11-20 20:58:12,231 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:58:12,233 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 20:58:12,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:58:12,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2022-11-20 20:58:12,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669928208] [2022-11-20 20:58:12,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:58:12,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 20:58:12,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:58:12,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 20:58:12,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=509, Unknown=3, NotChecked=144, Total=756 [2022-11-20 20:58:12,236 INFO L87 Difference]: Start difference. First operand 266 states and 305 transitions. Second operand has 26 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 8 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-20 20:58:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:58:22,747 INFO L93 Difference]: Finished difference Result 279 states and 325 transitions. [2022-11-20 20:58:22,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 20:58:22,748 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 8 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 47 [2022-11-20 20:58:22,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:58:22,749 INFO L225 Difference]: With dead ends: 279 [2022-11-20 20:58:22,750 INFO L226 Difference]: Without dead ends: 279 [2022-11-20 20:58:22,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=159, Invalid=842, Unknown=3, NotChecked=186, Total=1190 [2022-11-20 20:58:22,751 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 187 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 2454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1073 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:58:22,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 889 Invalid, 2454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1326 Invalid, 0 Unknown, 1073 Unchecked, 1.3s Time] [2022-11-20 20:58:22,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-20 20:58:22,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 266. [2022-11-20 20:58:22,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 146 states have (on average 1.7465753424657535) internal successors, (255), 240 states have internal predecessors, (255), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-20 20:58:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 303 transitions. [2022-11-20 20:58:22,759 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 303 transitions. Word has length 47 [2022-11-20 20:58:22,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:58:22,760 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 303 transitions. [2022-11-20 20:58:22,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 8 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-20 20:58:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 303 transitions. [2022-11-20 20:58:22,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 20:58:22,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:58:22,761 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-11-20 20:58:22,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 20:58:22,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-20 20:58:22,968 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-11-20 20:58:22,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:58:22,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1785924258, now seen corresponding path program 1 times [2022-11-20 20:58:22,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:58:22,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256370986] [2022-11-20 20:58:22,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:58:22,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:58:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:58:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:25,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:58:25,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256370986] [2022-11-20 20:58:25,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256370986] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:58:25,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707602624] [2022-11-20 20:58:25,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:58:25,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:58:25,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:58:25,692 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:58:25,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 20:58:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:58:25,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 105 conjunts are in the unsatisfiable core [2022-11-20 20:58:25,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:58:25,998 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-11-20 20:58:26,368 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-11-20 20:58:26,374 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-11-20 20:58:26,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-20 20:58:27,492 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 123 treesize of output 99 [2022-11-20 20:58:27,497 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 99 treesize of output 91 [2022-11-20 20:58:27,503 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 77 treesize of output 75 [2022-11-20 20:58:27,506 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 75 treesize of output 73 [2022-11-20 20:58:27,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:27,913 INFO L321 Elim1Store]: treesize reduction 99, result has 23.8 percent of original size [2022-11-20 20:58:27,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 115 treesize of output 125 [2022-11-20 20:58:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:27,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:58:28,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:58:28,859 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 21 treesize of output 22 [2022-11-20 20:58:28,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2022-11-20 20:58:28,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707602624] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:58:28,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1455089703] [2022-11-20 20:58:28,989 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-20 20:58:28,990 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:58:28,990 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 20:58:28,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:58:28,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 42 [2022-11-20 20:58:28,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138811507] [2022-11-20 20:58:28,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:58:28,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-20 20:58:28,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:58:28,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-20 20:58:28,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1740, Unknown=2, NotChecked=0, Total=1892 [2022-11-20 20:58:28,994 INFO L87 Difference]: Start difference. First operand 266 states and 303 transitions. Second operand has 43 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-20 20:58:36,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:58:36,203 INFO L93 Difference]: Finished difference Result 285 states and 324 transitions. [2022-11-20 20:58:36,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 20:58:36,206 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 48 [2022-11-20 20:58:36,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:58:36,207 INFO L225 Difference]: With dead ends: 285 [2022-11-20 20:58:36,208 INFO L226 Difference]: Without dead ends: 285 [2022-11-20 20:58:36,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=295, Invalid=3480, Unknown=7, NotChecked=0, Total=3782 [2022-11-20 20:58:36,209 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 131 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 2821 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 3537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 677 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:58:36,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 2120 Invalid, 3537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2821 Invalid, 0 Unknown, 677 Unchecked, 3.1s Time] [2022-11-20 20:58:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-20 20:58:36,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 268. [2022-11-20 20:58:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 148 states have (on average 1.75) internal successors, (259), 242 states have internal predecessors, (259), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-20 20:58:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 307 transitions. [2022-11-20 20:58:36,217 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 307 transitions. Word has length 48 [2022-11-20 20:58:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:58:36,218 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 307 transitions. [2022-11-20 20:58:36,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-20 20:58:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 307 transitions. [2022-11-20 20:58:36,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 20:58:36,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:58:36,219 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-11-20 20:58:36,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 20:58:36,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:58:36,436 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-11-20 20:58:36,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:58:36,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1785924257, now seen corresponding path program 1 times [2022-11-20 20:58:36,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:58:36,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798957006] [2022-11-20 20:58:36,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:58:36,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:58:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:58:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:39,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:58:39,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798957006] [2022-11-20 20:58:39,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798957006] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:58:39,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558630056] [2022-11-20 20:58:39,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:58:39,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:58:39,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:58:39,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:58:39,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 20:58:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:58:39,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 20:58:39,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:58:40,205 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-11-20 20:58:40,210 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-11-20 20:58:40,305 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_1860 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1860) |c_#length|)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-20 20:58:46,469 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_1861 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1861) |c_#length|)))) is different from true [2022-11-20 20:58:54,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:54,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:54,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:54,782 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 20:58:54,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 37 [2022-11-20 20:58:54,811 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:58:54,811 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-11-20 20:58:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2022-11-20 20:58:54,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:58:55,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558630056] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:58:55,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1803146394] [2022-11-20 20:58:55,316 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-20 20:58:55,316 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:58:55,317 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 20:58:55,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:58:55,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15] total 39 [2022-11-20 20:58:55,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615110621] [2022-11-20 20:58:55,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:58:55,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 20:58:55,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:58:55,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 20:58:55,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1336, Unknown=8, NotChecked=150, Total=1640 [2022-11-20 20:58:55,321 INFO L87 Difference]: Start difference. First operand 268 states and 307 transitions. Second operand has 40 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 32 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-20 20:59:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:59:12,663 INFO L93 Difference]: Finished difference Result 275 states and 316 transitions. [2022-11-20 20:59:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 20:59:12,664 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 32 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 48 [2022-11-20 20:59:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:59:12,666 INFO L225 Difference]: With dead ends: 275 [2022-11-20 20:59:12,666 INFO L226 Difference]: Without dead ends: 275 [2022-11-20 20:59:12,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=332, Invalid=2743, Unknown=13, NotChecked=218, Total=3306 [2022-11-20 20:59:12,668 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 290 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 3593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1056 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:59:12,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1745 Invalid, 3593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2472 Invalid, 0 Unknown, 1056 Unchecked, 2.4s Time] [2022-11-20 20:59:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-20 20:59:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2022-11-20 20:59:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 151 states have (on average 1.7350993377483444) internal successors, (262), 246 states have internal predecessors, (262), 30 states have call successors, (30), 12 states have call predecessors, (30), 14 states have return successors, (22), 18 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-20 20:59:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 314 transitions. [2022-11-20 20:59:12,679 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 314 transitions. Word has length 48 [2022-11-20 20:59:12,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:59:12,679 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 314 transitions. [2022-11-20 20:59:12,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 32 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-20 20:59:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 314 transitions. [2022-11-20 20:59:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 20:59:12,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:59:12,681 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-11-20 20:59:12,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 20:59:12,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:59:12,888 INFO L420 AbstractCegarLoop]: === Iteration 24 === 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-11-20 20:59:12,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:59:12,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1639410555, now seen corresponding path program 1 times [2022-11-20 20:59:12,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:59:12,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038087189] [2022-11-20 20:59:12,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:59:12,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:59:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:59:13,725 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 20:59:13,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:59:13,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038087189] [2022-11-20 20:59:13,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038087189] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:59:13,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035407038] [2022-11-20 20:59:13,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:59:13,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:59:13,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:59:13,731 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:59:13,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 20:59:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:59:14,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-20 20:59:14,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:59:14,153 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-11-20 20:59:14,339 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-20 20:59:14,339 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-11-20 20:59:14,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:14,392 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-11-20 20:59:14,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:14,410 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-11-20 20:59:14,444 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-11-20 20:59:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 20:59:14,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:59:14,487 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2106 (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_2106) |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-11-20 20:59:14,769 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:59:14,769 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-11-20 20:59:14,774 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-11-20 20:59:14,801 INFO L321 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-11-20 20:59:14,802 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-11-20 20:59:14,808 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-11-20 20:59:14,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:59:14,943 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-11-20 20:59:14,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:59:14,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:59:14,957 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-11-20 20:59:15,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:59:15,281 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-11-20 20:59:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2022-11-20 20:59:15,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035407038] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:59:15,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [506188171] [2022-11-20 20:59:15,900 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-20 20:59:15,900 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:59:15,901 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 20:59:15,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:59:15,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 30 [2022-11-20 20:59:15,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726350596] [2022-11-20 20:59:15,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:59:15,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-20 20:59:15,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:59:15,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-20 20:59:15,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=4, NotChecked=56, Total=930 [2022-11-20 20:59:15,909 INFO L87 Difference]: Start difference. First operand 274 states and 314 transitions. Second operand has 31 states, 28 states have (on average 2.642857142857143) internal successors, (74), 29 states have internal predecessors, (74), 6 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 20:59:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:59:17,418 INFO L93 Difference]: Finished difference Result 273 states and 313 transitions. [2022-11-20 20:59:17,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 20:59:17,419 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.642857142857143) internal successors, (74), 29 states have internal predecessors, (74), 6 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2022-11-20 20:59:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:59:17,420 INFO L225 Difference]: With dead ends: 273 [2022-11-20 20:59:17,420 INFO L226 Difference]: Without dead ends: 273 [2022-11-20 20:59:17,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=287, Invalid=1353, Unknown=4, NotChecked=78, Total=1722 [2022-11-20 20:59:17,421 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 94 mSDsluCounter, 2529 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 2726 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 709 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 20:59:17,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 2726 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1169 Invalid, 0 Unknown, 709 Unchecked, 0.9s Time] [2022-11-20 20:59:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-11-20 20:59:17,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2022-11-20 20:59:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 151 states have (on average 1.728476821192053) internal successors, (261), 245 states have internal predecessors, (261), 30 states have call successors, (30), 12 states have call predecessors, (30), 14 states have return successors, (22), 18 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-20 20:59:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 313 transitions. [2022-11-20 20:59:17,428 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 313 transitions. Word has length 51 [2022-11-20 20:59:17,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:59:17,429 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 313 transitions. [2022-11-20 20:59:17,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.642857142857143) internal successors, (74), 29 states have internal predecessors, (74), 6 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 20:59:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 313 transitions. [2022-11-20 20:59:17,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-20 20:59:17,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:59:17,430 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-11-20 20:59:17,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 20:59:17,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-20 20:59:17,644 INFO L420 AbstractCegarLoop]: === Iteration 25 === 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-11-20 20:59:17,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:59:17,645 INFO L85 PathProgramCache]: Analyzing trace with hash -410953665, now seen corresponding path program 1 times [2022-11-20 20:59:17,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:59:17,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391526300] [2022-11-20 20:59:17,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:59:17,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:59:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:59:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 20:59:18,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:59:18,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391526300] [2022-11-20 20:59:18,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391526300] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:59:18,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999804578] [2022-11-20 20:59:18,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:59:18,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:59:18,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:59:18,046 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:59:18,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 20:59:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:59:18,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 20:59:18,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:59:18,462 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 20:59:18,462 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-11-20 20:59:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 20:59:18,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:59:18,699 INFO L321 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-11-20 20:59:18,700 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-11-20 20:59:18,747 INFO L321 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-11-20 20:59:18,748 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-11-20 20:59:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 20:59:18,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999804578] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:59:18,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [819114589] [2022-11-20 20:59:18,805 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-20 20:59:18,805 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:59:18,806 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 20:59:18,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:59:18,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-11-20 20:59:18,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916210278] [2022-11-20 20:59:18,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:59:18,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 20:59:18,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:59:18,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 20:59:18,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-11-20 20:59:18,809 INFO L87 Difference]: Start difference. First operand 273 states and 313 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-11-20 20:59:19,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:59:19,132 INFO L93 Difference]: Finished difference Result 282 states and 324 transitions. [2022-11-20 20:59:19,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 20:59:19,133 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-11-20 20:59:19,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:59:19,134 INFO L225 Difference]: With dead ends: 282 [2022-11-20 20:59:19,135 INFO L226 Difference]: Without dead ends: 282 [2022-11-20 20:59:19,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-11-20 20:59:19,137 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 59 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 466 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:59:19,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1216 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 264 Invalid, 0 Unknown, 466 Unchecked, 0.3s Time] [2022-11-20 20:59:19,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-20 20:59:19,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2022-11-20 20:59:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 158 states have (on average 1.7025316455696202) internal successors, (269), 251 states have internal predecessors, (269), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2022-11-20 20:59:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 324 transitions. [2022-11-20 20:59:19,155 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 324 transitions. Word has length 60 [2022-11-20 20:59:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:59:19,156 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 324 transitions. [2022-11-20 20:59:19,157 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-11-20 20:59:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 324 transitions. [2022-11-20 20:59:19,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-20 20:59:19,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:59:19,158 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-11-20 20:59:19,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 20:59:19,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 20:59:19,365 INFO L420 AbstractCegarLoop]: === Iteration 26 === 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-11-20 20:59:19,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:59:19,365 INFO L85 PathProgramCache]: Analyzing trace with hash -410953664, now seen corresponding path program 1 times [2022-11-20 20:59:19,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:59:19,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43503843] [2022-11-20 20:59:19,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:59:19,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:59:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:59:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-20 20:59:20,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:59:20,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43503843] [2022-11-20 20:59:20,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43503843] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:59:20,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815795064] [2022-11-20 20:59:20,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:59:20,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:59:20,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:59:20,085 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:59:20,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 20:59:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:59:20,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-20 20:59:20,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:59:20,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:20,734 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-11-20 20:59:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-20 20:59:20,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:59:23,441 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-11-20 20:59:23,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:59:23,611 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 20:59:23,611 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-11-20 20:59:23,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:59:23,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:59:23,713 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-11-20 20:59:23,885 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-20 20:59:23,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815795064] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:59:23,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1949407681] [2022-11-20 20:59:23,887 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-20 20:59:23,887 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:59:23,888 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 20:59:23,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:59:23,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2022-11-20 20:59:23,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990328960] [2022-11-20 20:59:23,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:59:23,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 20:59:23,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:59:23,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 20:59:23,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2022-11-20 20:59:23,890 INFO L87 Difference]: Start difference. First operand 281 states and 324 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-11-20 20:59:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:59:25,285 INFO L93 Difference]: Finished difference Result 284 states and 331 transitions. [2022-11-20 20:59:25,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:59:25,286 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-11-20 20:59:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:59:25,287 INFO L225 Difference]: With dead ends: 284 [2022-11-20 20:59:25,287 INFO L226 Difference]: Without dead ends: 284 [2022-11-20 20:59:25,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=204, Invalid=1518, Unknown=0, NotChecked=0, Total=1722 [2022-11-20 20:59:25,288 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 182 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 2461 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 469 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:59:25,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 2461 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1349 Invalid, 0 Unknown, 469 Unchecked, 1.0s Time] [2022-11-20 20:59:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-11-20 20:59:25,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 269. [2022-11-20 20:59:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 151 states have (on average 1.7019867549668874) internal successors, (257), 241 states have internal predecessors, (257), 30 states have call successors, (30), 12 states have call predecessors, (30), 14 states have return successors, (22), 18 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-20 20:59:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 309 transitions. [2022-11-20 20:59:25,298 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 309 transitions. Word has length 60 [2022-11-20 20:59:25,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:59:25,298 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 309 transitions. [2022-11-20 20:59:25,299 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-11-20 20:59:25,299 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 309 transitions. [2022-11-20 20:59:25,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-20 20:59:25,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:59:25,300 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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-11-20 20:59:25,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 20:59:25,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:59:25,513 INFO L420 AbstractCegarLoop]: === Iteration 27 === 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-11-20 20:59:25,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:59:25,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1578028647, now seen corresponding path program 1 times [2022-11-20 20:59:25,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:59:25,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651024502] [2022-11-20 20:59:25,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:59:25,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:59:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:59:26,371 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 20:59:26,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:59:26,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651024502] [2022-11-20 20:59:26,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651024502] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:59:26,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342802541] [2022-11-20 20:59:26,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:59:26,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:59:26,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:59:26,373 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:59:26,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 20:59:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:59:26,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-20 20:59:26,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:59:26,815 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-11-20 20:59:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:59:35,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:59:36,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342802541] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:59:36,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [189690855] [2022-11-20 20:59:36,051 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-20 20:59:36,051 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:59:36,052 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 20:59:36,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:59:36,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 26 [2022-11-20 20:59:36,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615180205] [2022-11-20 20:59:36,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:59:36,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 20:59:36,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:59:36,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 20:59:36,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=621, Unknown=7, NotChecked=0, Total=702 [2022-11-20 20:59:36,055 INFO L87 Difference]: Start difference. First operand 269 states and 309 transitions. Second operand has 26 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-20 20:59:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:59:43,536 INFO L93 Difference]: Finished difference Result 272 states and 311 transitions. [2022-11-20 20:59:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 20:59:43,537 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 60 [2022-11-20 20:59:43,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:59:43,538 INFO L225 Difference]: With dead ends: 272 [2022-11-20 20:59:43,539 INFO L226 Difference]: Without dead ends: 269 [2022-11-20 20:59:43,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=147, Invalid=1172, Unknown=13, NotChecked=0, Total=1332 [2022-11-20 20:59:43,540 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 77 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 379 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:59:43,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1914 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1515 Invalid, 0 Unknown, 379 Unchecked, 1.0s Time] [2022-11-20 20:59:43,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-20 20:59:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2022-11-20 20:59:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 151 states have (on average 1.695364238410596) internal successors, (256), 241 states have internal predecessors, (256), 30 states have call successors, (30), 12 states have call predecessors, (30), 14 states have return successors, (22), 18 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-20 20:59:43,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 308 transitions. [2022-11-20 20:59:43,547 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 308 transitions. Word has length 60 [2022-11-20 20:59:43,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:59:43,548 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 308 transitions. [2022-11-20 20:59:43,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-20 20:59:43,548 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 308 transitions. [2022-11-20 20:59:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-20 20:59:43,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:59:43,549 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-11-20 20:59:43,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 20:59:43,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-20 20:59:43,756 INFO L420 AbstractCegarLoop]: === Iteration 28 === 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-11-20 20:59:43,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:59:43,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1299602016, now seen corresponding path program 2 times [2022-11-20 20:59:43,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:59:43,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279310088] [2022-11-20 20:59:43,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:59:43,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:59:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:59:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:59:47,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:59:47,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279310088] [2022-11-20 20:59:47,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279310088] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:59:47,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933126535] [2022-11-20 20:59:47,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:59:47,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:59:47,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:59:47,026 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:59:47,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 20:59:47,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 20:59:47,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:59:47,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-20 20:59:47,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:59:48,002 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-11-20 20:59:48,067 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-11-20 20:59:48,261 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 20:59:48,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 20:59:48,614 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-11-20 20:59:48,624 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset| Int) (v_ArrVal_3096 Int)) (and (= |c_#valid| (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|) v_ArrVal_3096)) (<= |##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|))) is different from true [2022-11-20 20:59:48,843 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 20:59:48,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 20:59:49,155 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3102 (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)) (= (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_3102) |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_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-20 20:59:53,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:53,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:59:53,329 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 29 treesize of output 21 [2022-11-20 20:59:53,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:53,871 INFO L321 Elim1Store]: treesize reduction 152, result has 20.0 percent of original size [2022-11-20 20:59:53,872 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 50 treesize of output 73 [2022-11-20 20:59:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2022-11-20 20:59:53,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:59:54,695 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:59:54,696 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-11-20 20:59:54,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:59:54,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:54,704 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 51 treesize of output 39 [2022-11-20 20:59:54,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933126535] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:59:54,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1568805888] [2022-11-20 20:59:54,805 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-20 20:59:54,805 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:59:54,806 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 20:59:54,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:59:54,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24] total 46 [2022-11-20 20:59:54,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67853579] [2022-11-20 20:59:54,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:59:54,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-20 20:59:54,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:59:54,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-20 20:59:54,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1863, Unknown=6, NotChecked=178, Total=2256 [2022-11-20 20:59:54,810 INFO L87 Difference]: Start difference. First operand 269 states and 308 transitions. Second operand has 47 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 44 states have internal predecessors, (83), 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-11-20 21:00:03,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:00:03,567 INFO L93 Difference]: Finished difference Result 294 states and 340 transitions. [2022-11-20 21:00:03,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-20 21:00:03,568 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 44 states have internal predecessors, (83), 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-11-20 21:00:03,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:00:03,569 INFO L225 Difference]: With dead ends: 294 [2022-11-20 21:00:03,570 INFO L226 Difference]: Without dead ends: 294 [2022-11-20 21:00:03,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1261 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=446, Invalid=3836, Unknown=16, NotChecked=258, Total=4556 [2022-11-20 21:00:03,572 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 325 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 3556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1914 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:00:03,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1335 Invalid, 3556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1510 Invalid, 0 Unknown, 1914 Unchecked, 2.2s Time] [2022-11-20 21:00:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-20 21:00:03,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 289. [2022-11-20 21:00:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 167 states have (on average 1.6467065868263473) internal successors, (275), 256 states have internal predecessors, (275), 31 states have call successors, (31), 13 states have call predecessors, (31), 17 states have return successors, (27), 22 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-20 21:00:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 333 transitions. [2022-11-20 21:00:03,580 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 333 transitions. Word has length 61 [2022-11-20 21:00:03,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:00:03,581 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 333 transitions. [2022-11-20 21:00:03,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 44 states have internal predecessors, (83), 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-11-20 21:00:03,581 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 333 transitions. [2022-11-20 21:00:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-20 21:00:03,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:00:03,582 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-11-20 21:00:03,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 21:00:03,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 21:00:03,791 INFO L420 AbstractCegarLoop]: === Iteration 29 === 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-11-20 21:00:03,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:00:03,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1299602015, now seen corresponding path program 1 times [2022-11-20 21:00:03,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:00:03,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241720761] [2022-11-20 21:00:03,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:00:03,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:00:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:00:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 21:00:06,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:00:06,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241720761] [2022-11-20 21:00:06,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241720761] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:00:06,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749242517] [2022-11-20 21:00:06,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:00:06,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:00:06,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:00:06,166 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:00:06,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 21:00:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:00:06,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 172 conjunts are in the unsatisfiable core [2022-11-20 21:00:06,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:00:06,560 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-11-20 21:00:06,788 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-11-20 21:00:06,793 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-11-20 21:00:07,401 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-11-20 21:00:07,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:07,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:07,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2022-11-20 21:00:07,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2022-11-20 21:00:07,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:07,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:07,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 21:00:07,665 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-11-20 21:00:07,670 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-11-20 21:00:08,425 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-11-20 21:00:08,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:08,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 79 [2022-11-20 21:00:08,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:08,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 21:00:08,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:08,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:08,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:08,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:08,884 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-20 21:00:08,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 34 [2022-11-20 21:00:08,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-11-20 21:00:09,299 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-11-20 21:00:10,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:10,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:10,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:10,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:10,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:10,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:10,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:10,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:10,054 INFO L321 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-11-20 21:00:10,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 38 [2022-11-20 21:00:10,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:10,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:10,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:10,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:10,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:10,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:10,145 INFO L321 Elim1Store]: treesize reduction 34, result has 40.4 percent of original size [2022-11-20 21:00:10,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 72 [2022-11-20 21:00:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 21:00:10,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:00:12,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:00:12,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:00:12,608 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 21:00:12,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 66 [2022-11-20 21:00:12,626 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 37 treesize of output 35 [2022-11-20 21:00:12,637 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 80 treesize of output 72 [2022-11-20 21:00:21,185 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:00:21,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749242517] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:00:21,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [743249190] [2022-11-20 21:00:21,189 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-20 21:00:21,189 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:00:21,189 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 21:00:21,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:00:21,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 29] total 44 [2022-11-20 21:00:21,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460512538] [2022-11-20 21:00:21,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:00:21,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-20 21:00:21,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:00:21,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-20 21:00:21,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1887, Unknown=11, NotChecked=0, Total=2162 [2022-11-20 21:00:21,191 INFO L87 Difference]: Start difference. First operand 289 states and 333 transitions. Second operand has 45 states, 40 states have (on average 2.225) internal successors, (89), 39 states have internal predecessors, (89), 10 states have call successors, (12), 4 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-20 21:00:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:00:24,177 INFO L93 Difference]: Finished difference Result 296 states and 342 transitions. [2022-11-20 21:00:24,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 21:00:24,178 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 2.225) internal successors, (89), 39 states have internal predecessors, (89), 10 states have call successors, (12), 4 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 61 [2022-11-20 21:00:24,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:00:24,180 INFO L225 Difference]: With dead ends: 296 [2022-11-20 21:00:24,180 INFO L226 Difference]: Without dead ends: 296 [2022-11-20 21:00:24,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=359, Invalid=2592, Unknown=19, NotChecked=0, Total=2970 [2022-11-20 21:00:24,181 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 283 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 3249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1280 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-20 21:00:24,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1388 Invalid, 3249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1876 Invalid, 0 Unknown, 1280 Unchecked, 2.0s Time] [2022-11-20 21:00:24,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-11-20 21:00:24,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 289. [2022-11-20 21:00:24,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 167 states have (on average 1.6347305389221556) internal successors, (273), 256 states have internal predecessors, (273), 31 states have call successors, (31), 13 states have call predecessors, (31), 17 states have return successors, (27), 22 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-20 21:00:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 331 transitions. [2022-11-20 21:00:24,189 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 331 transitions. Word has length 61 [2022-11-20 21:00:24,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:00:24,190 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 331 transitions. [2022-11-20 21:00:24,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 2.225) internal successors, (89), 39 states have internal predecessors, (89), 10 states have call successors, (12), 4 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-20 21:00:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 331 transitions. [2022-11-20 21:00:24,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-20 21:00:24,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:00:24,191 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-11-20 21:00:24,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 21:00:24,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 21:00:24,399 INFO L420 AbstractCegarLoop]: === Iteration 30 === 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-11-20 21:00:24,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:00:24,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2044777986, now seen corresponding path program 1 times [2022-11-20 21:00:24,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:00:24,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287768932] [2022-11-20 21:00:24,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:00:24,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:00:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:00:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 21:00:25,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:00:25,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287768932] [2022-11-20 21:00:25,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287768932] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:00:25,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739144014] [2022-11-20 21:00:25,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:00:25,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:00:25,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:00:25,231 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:00:25,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 21:00:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:00:25,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-20 21:00:25,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:00:25,799 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-11-20 21:00:26,068 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-20 21:00:26,068 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-11-20 21:00:26,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:26,123 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-11-20 21:00:26,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:26,140 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-11-20 21:00:26,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:26,157 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-11-20 21:00:26,196 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-11-20 21:00:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-20 21:00:26,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:00:28,746 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:28,746 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-11-20 21:00:28,756 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-11-20 21:00:28,786 INFO L321 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-11-20 21:00:28,786 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-11-20 21:00:28,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-11-20 21:00:29,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:29,004 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-11-20 21:00:29,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:00:29,018 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-20 21:00:29,019 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-11-20 21:00:29,043 INFO L321 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-11-20 21:00:29,044 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-11-20 21:00:29,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:29,175 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-11-20 21:00:29,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:00:29,187 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:29,187 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-11-20 21:00:29,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:29,489 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-11-20 21:00:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-20 21:00:29,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739144014] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:00:29,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [342039359] [2022-11-20 21:00:29,866 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-11-20 21:00:29,866 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:00:29,867 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 21:00:29,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:00:29,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 32 [2022-11-20 21:00:29,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631482896] [2022-11-20 21:00:29,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:00:29,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 21:00:29,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:00:29,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 21:00:29,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=944, Unknown=12, NotChecked=0, Total=1056 [2022-11-20 21:00:29,869 INFO L87 Difference]: Start difference. First operand 289 states and 331 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-11-20 21:00:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:00:31,378 INFO L93 Difference]: Finished difference Result 292 states and 336 transitions. [2022-11-20 21:00:31,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 21:00:31,379 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-11-20 21:00:31,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:00:31,381 INFO L225 Difference]: With dead ends: 292 [2022-11-20 21:00:31,381 INFO L226 Difference]: Without dead ends: 292 [2022-11-20 21:00:31,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=226, Invalid=1654, Unknown=12, NotChecked=0, Total=1892 [2022-11-20 21:00:31,382 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 63 mSDsluCounter, 2707 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 2908 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 757 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 21:00:31,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 2908 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1094 Invalid, 0 Unknown, 757 Unchecked, 0.9s Time] [2022-11-20 21:00:31,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-20 21:00:31,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2022-11-20 21:00:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 167 states have (on average 1.6287425149700598) internal successors, (272), 255 states have internal predecessors, (272), 31 states have call successors, (31), 13 states have call predecessors, (31), 17 states have return successors, (27), 22 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-20 21:00:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 330 transitions. [2022-11-20 21:00:31,390 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 330 transitions. Word has length 63 [2022-11-20 21:00:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:00:31,390 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 330 transitions. [2022-11-20 21:00:31,391 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-11-20 21:00:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 330 transitions. [2022-11-20 21:00:31,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-20 21:00:31,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:00:31,392 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-11-20 21:00:31,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 21:00:31,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:00:31,599 INFO L420 AbstractCegarLoop]: === Iteration 31 === 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-11-20 21:00:31,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:00:31,599 INFO L85 PathProgramCache]: Analyzing trace with hash -2044777985, now seen corresponding path program 1 times [2022-11-20 21:00:31,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:00:31,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988266802] [2022-11-20 21:00:31,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:00:31,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:00:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:00:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 21:00:32,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:00:32,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988266802] [2022-11-20 21:00:32,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988266802] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:00:32,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928429580] [2022-11-20 21:00:32,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:00:32,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:00:32,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:00:32,943 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:00:32,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 21:00:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:00:33,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-20 21:00:33,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:00:33,573 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-11-20 21:00:33,582 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-11-20 21:00:33,904 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 21:00:33,905 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-11-20 21:00:33,916 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-11-20 21:00:33,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:33,972 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-11-20 21:00:33,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:33,983 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-11-20 21:00:33,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:34,000 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-11-20 21:00:34,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:34,019 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-11-20 21:00:34,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:34,037 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-11-20 21:00:34,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:34,046 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-11-20 21:00:34,094 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-11-20 21:00:34,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 21:00:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-20 21:00:34,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:00:34,206 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4027 (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_4027) |c_dll_insert_master_~dll#1.base|) |c_dll_insert_master_~dll#1.offset|) 4))) (forall ((v_ArrVal_4026 (Array Int Int)) (v_ArrVal_4027 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_dll_insert_master_alloc_or_die_master_~ptr~1#1.base| v_ArrVal_4027) |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_4026) |c_dll_insert_master_~dll#1.base|) |c_dll_insert_master_~dll#1.offset|))))) is different from false [2022-11-20 21:00:35,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:35,179 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-11-20 21:00:35,184 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-11-20 21:00:35,204 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:35,205 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-11-20 21:00:35,211 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-11-20 21:00:35,227 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:35,227 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-11-20 21:00:35,234 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 162 treesize of output 152 [2022-11-20 21:00:35,241 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 143 treesize of output 135 [2022-11-20 21:00:35,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:35,270 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-11-20 21:00:35,280 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-11-20 21:00:36,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:36,953 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-11-20 21:00:36,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:36,966 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-11-20 21:00:36,997 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-20 21:00:36,998 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-11-20 21:00:37,020 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-20 21:00:37,020 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-11-20 21:00:37,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:37,057 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-11-20 21:00:37,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 161 [2022-11-20 21:00:37,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 170 [2022-11-20 21:00:37,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:37,118 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-11-20 21:00:37,133 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-11-20 21:00:38,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:38,678 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-11-20 21:00:38,687 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:38,687 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-11-20 21:00:38,691 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:00:38,701 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:38,702 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-11-20 21:00:38,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:00:38,717 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:38,717 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-11-20 21:00:38,763 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:38,763 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-11-20 21:00:38,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:00:38,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:38,774 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-11-20 21:00:55,026 WARN L233 SmtUtils]: Spent 16.16s 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-11-20 21:00:55,046 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-11-20 21:00:55,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:00:55,105 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-11-20 21:00:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 3 not checked. [2022-11-20 21:00:55,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928429580] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:00:55,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1807927105] [2022-11-20 21:00:55,531 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-11-20 21:00:55,531 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:00:55,532 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 21:00:55,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:00:55,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 35 [2022-11-20 21:00:55,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280656774] [2022-11-20 21:00:55,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:00:55,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 21:00:55,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:00:55,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 21:00:55,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1083, Unknown=3, NotChecked=66, Total=1260 [2022-11-20 21:00:55,535 INFO L87 Difference]: Start difference. First operand 288 states and 330 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-11-20 21:00:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:00:57,437 INFO L93 Difference]: Finished difference Result 287 states and 329 transitions. [2022-11-20 21:00:57,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 21:00:57,437 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-11-20 21:00:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:00:57,438 INFO L225 Difference]: With dead ends: 287 [2022-11-20 21:00:57,439 INFO L226 Difference]: Without dead ends: 287 [2022-11-20 21:00:57,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=236, Invalid=1927, Unknown=3, NotChecked=90, Total=2256 [2022-11-20 21:00:57,440 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 75 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 2913 SdHoareTripleChecker+Invalid, 2332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 911 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:00:57,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 2913 Invalid, 2332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1393 Invalid, 0 Unknown, 911 Unchecked, 1.1s Time] [2022-11-20 21:00:57,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-20 21:00:57,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2022-11-20 21:00:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 167 states have (on average 1.622754491017964) internal successors, (271), 254 states have internal predecessors, (271), 31 states have call successors, (31), 13 states have call predecessors, (31), 17 states have return successors, (27), 22 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-20 21:00:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 329 transitions. [2022-11-20 21:00:57,453 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 329 transitions. Word has length 63 [2022-11-20 21:00:57,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:00:57,453 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 329 transitions. [2022-11-20 21:00:57,453 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-11-20 21:00:57,453 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 329 transitions. [2022-11-20 21:00:57,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-20 21:00:57,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:00:57,454 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-11-20 21:00:57,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 21:00:57,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:00:57,655 INFO L420 AbstractCegarLoop]: === Iteration 32 === 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-11-20 21:00:57,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:00:57,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1632937661, now seen corresponding path program 1 times [2022-11-20 21:00:57,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:00:57,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299583016] [2022-11-20 21:00:57,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:00:57,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:00:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:00:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-20 21:00:59,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:00:59,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299583016] [2022-11-20 21:00:59,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299583016] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:00:59,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667467753] [2022-11-20 21:00:59,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:00:59,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:00:59,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:00:59,447 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:00:59,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 21:00:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:00:59,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-20 21:00:59,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:00:59,986 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-11-20 21:01:00,472 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-11-20 21:01:00,479 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-11-20 21:01:01,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-20 21:01:03,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 166 [2022-11-20 21:01:03,770 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 140 treesize of output 136 [2022-11-20 21:01:03,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 156 treesize of output 148 [2022-11-20 21:01:03,784 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 134 treesize of output 132 [2022-11-20 21:01:03,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 128 [2022-11-20 21:01:04,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:04,791 INFO L321 Elim1Store]: treesize reduction 152, result has 25.1 percent of original size [2022-11-20 21:01:04,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 466 treesize of output 489 [2022-11-20 21:01:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:01:05,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:01:06,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:01:06,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 50 [2022-11-20 21:01:06,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 93 [2022-11-20 21:01:06,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667467753] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:01:06,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1652951872] [2022-11-20 21:01:06,310 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-20 21:01:06,310 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:01:06,311 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 21:01:06,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:01:06,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 30] total 37 [2022-11-20 21:01:06,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9983734] [2022-11-20 21:01:06,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:01:06,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-20 21:01:06,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:01:06,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-20 21:01:06,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1340, Unknown=3, NotChecked=0, Total=1482 [2022-11-20 21:01:06,314 INFO L87 Difference]: Start difference. First operand 287 states and 329 transitions. Second operand has 38 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-20 21:01:11,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:01:11,146 INFO L93 Difference]: Finished difference Result 294 states and 340 transitions. [2022-11-20 21:01:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-20 21:01:11,147 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) Word has length 62 [2022-11-20 21:01:11,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:01:11,149 INFO L225 Difference]: With dead ends: 294 [2022-11-20 21:01:11,150 INFO L226 Difference]: Without dead ends: 294 [2022-11-20 21:01:11,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=348, Invalid=3665, Unknown=19, NotChecked=0, Total=4032 [2022-11-20 21:01:11,153 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 124 mSDsluCounter, 2285 mSDsCounter, 0 mSdLazyCounter, 2008 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1445 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:01:11,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 2428 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2008 Invalid, 0 Unknown, 1445 Unchecked, 2.1s Time] [2022-11-20 21:01:11,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-20 21:01:11,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 285. [2022-11-20 21:01:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 165 states have (on average 1.6303030303030304) internal successors, (269), 254 states have internal predecessors, (269), 31 states have call successors, (31), 13 states have call predecessors, (31), 17 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-20 21:01:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 327 transitions. [2022-11-20 21:01:11,170 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 327 transitions. Word has length 62 [2022-11-20 21:01:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:01:11,170 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 327 transitions. [2022-11-20 21:01:11,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-20 21:01:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 327 transitions. [2022-11-20 21:01:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-20 21:01:11,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:01:11,175 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-11-20 21:01:11,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-20 21:01:11,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:01:11,382 INFO L420 AbstractCegarLoop]: === Iteration 33 === 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-11-20 21:01:11,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:01:11,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1632937660, now seen corresponding path program 1 times [2022-11-20 21:01:11,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:01:11,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923837279] [2022-11-20 21:01:11,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:01:11,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:01:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:01:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-20 21:01:13,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:01:13,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923837279] [2022-11-20 21:01:13,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923837279] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:01:13,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329750736] [2022-11-20 21:01:13,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:01:13,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:01:13,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:01:13,107 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:01:13,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 21:01:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:01:13,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-20 21:01:13,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:01:13,801 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-11-20 21:01:13,805 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-11-20 21:01:13,867 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_4613 Int)) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4613))) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-20 21:01:19,995 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_4614 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4614) |c_#length|)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-20 21:01:28,843 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_4615 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4615) |c_#length|)))) is different from true [2022-11-20 21:01:43,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:43,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:43,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:43,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:43,178 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 21:01:43,178 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-11-20 21:01:43,193 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 21:01:43,193 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-11-20 21:01:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 25 not checked. [2022-11-20 21:01:43,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:01:43,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329750736] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:01:43,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1002257528] [2022-11-20 21:01:43,675 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-20 21:01:43,675 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:01:43,676 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 21:01:43,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:01:43,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-11-20 21:01:43,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949275300] [2022-11-20 21:01:43,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:01:43,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 21:01:43,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:01:43,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 21:01:43,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=763, Unknown=17, NotChecked=174, Total=1056 [2022-11-20 21:01:43,679 INFO L87 Difference]: Start difference. First operand 285 states and 327 transitions. Second operand has 32 states, 25 states have (on average 3.04) internal successors, (76), 25 states have internal predecessors, (76), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-20 21:02:13,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:02:13,225 INFO L93 Difference]: Finished difference Result 307 states and 359 transitions. [2022-11-20 21:02:13,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 21:02:13,226 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 3.04) internal successors, (76), 25 states have internal predecessors, (76), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 62 [2022-11-20 21:02:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:02:13,227 INFO L225 Difference]: With dead ends: 307 [2022-11-20 21:02:13,228 INFO L226 Difference]: Without dead ends: 307 [2022-11-20 21:02:13,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 57.6s TimeCoverageRelationStatistics Valid=220, Invalid=1574, Unknown=24, NotChecked=252, Total=2070 [2022-11-20 21:02:13,229 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 249 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 2925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1181 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 21:02:13,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1673 Invalid, 2925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1656 Invalid, 0 Unknown, 1181 Unchecked, 1.8s Time] [2022-11-20 21:02:13,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-11-20 21:02:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 306. [2022-11-20 21:02:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 180 states have (on average 1.5833333333333333) internal successors, (285), 270 states have internal predecessors, (285), 34 states have call successors, (34), 15 states have call predecessors, (34), 20 states have return successors, (38), 23 states have call predecessors, (38), 20 states have call successors, (38) [2022-11-20 21:02:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 357 transitions. [2022-11-20 21:02:13,238 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 357 transitions. Word has length 62 [2022-11-20 21:02:13,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:02:13,238 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 357 transitions. [2022-11-20 21:02:13,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 3.04) internal successors, (76), 25 states have internal predecessors, (76), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-20 21:02:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 357 transitions. [2022-11-20 21:02:13,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-20 21:02:13,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:02:13,241 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 5, 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] [2022-11-20 21:02:13,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 21:02:13,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:02:13,449 INFO L420 AbstractCegarLoop]: === Iteration 34 === 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-11-20 21:02:13,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:02:13,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1272622707, now seen corresponding path program 1 times [2022-11-20 21:02:13,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:02:13,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814454219] [2022-11-20 21:02:13,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:02:13,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:02:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:02:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 14 proven. 26 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-20 21:02:14,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:02:14,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814454219] [2022-11-20 21:02:14,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814454219] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:02:14,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667529291] [2022-11-20 21:02:14,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:02:14,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:02:14,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:02:14,530 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:02:14,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 21:02:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:02:15,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-20 21:02:15,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:02:15,281 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-11-20 21:02:15,284 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-11-20 21:02:15,608 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_5104 Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5104)))) is different from true [2022-11-20 21:02:17,751 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_5105 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_5105) |c_#length|))) is different from true [2022-11-20 21:02:24,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:24,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:24,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:24,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:24,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:24,221 INFO L321 Elim1Store]: treesize reduction 56, result has 37.8 percent of original size [2022-11-20 21:02:24,222 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 3 case distinctions, treesize of input 23 treesize of output 49 [2022-11-20 21:02:24,250 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:02:24,250 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 20 treesize of output 22 [2022-11-20 21:02:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 103 proven. 19 refuted. 0 times theorem prover too weak. 19 trivial. 25 not checked. [2022-11-20 21:02:24,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:02:30,900 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:02:30,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667529291] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:02:30,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1725160078] [2022-11-20 21:02:30,903 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-11-20 21:02:30,903 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:02:30,903 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 21:02:30,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:02:30,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32 [2022-11-20 21:02:30,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640157684] [2022-11-20 21:02:30,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:02:30,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 21:02:30,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:02:30,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 21:02:30,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=856, Unknown=4, NotChecked=118, Total=1056 [2022-11-20 21:02:30,906 INFO L87 Difference]: Start difference. First operand 306 states and 357 transitions. Second operand has 32 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 26 states have internal predecessors, (99), 14 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2022-11-20 21:02:31,357 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_5105 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_5105) |c_#length|))) (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_5104 Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5104)))) (exists ((|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (v_ArrVal_5103 Int)) (and (= (select |c_old(#valid)| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 0) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_5103) |c_#length|)))) is different from true [2022-11-20 21:02:35,560 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_5105 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_5105) |c_#length|))) (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_5104 Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5104))))) is different from true [2022-11-20 21:02:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:02:37,966 INFO L93 Difference]: Finished difference Result 318 states and 352 transitions. [2022-11-20 21:02:37,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-20 21:02:37,967 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 26 states have internal predecessors, (99), 14 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) Word has length 110 [2022-11-20 21:02:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:02:37,968 INFO L225 Difference]: With dead ends: 318 [2022-11-20 21:02:37,968 INFO L226 Difference]: Without dead ends: 318 [2022-11-20 21:02:37,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=292, Invalid=2792, Unknown=12, NotChecked=444, Total=3540 [2022-11-20 21:02:37,968 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 144 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 2723 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2748 SdHoareTripleChecker+Invalid, 4161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1389 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 21:02:37,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2748 Invalid, 4161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2723 Invalid, 0 Unknown, 1389 Unchecked, 1.8s Time] [2022-11-20 21:02:37,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-11-20 21:02:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 294. [2022-11-20 21:02:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 174 states have (on average 1.5804597701149425) internal successors, (275), 261 states have internal predecessors, (275), 32 states have call successors, (32), 15 states have call predecessors, (32), 16 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-20 21:02:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 330 transitions. [2022-11-20 21:02:37,976 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 330 transitions. Word has length 110 [2022-11-20 21:02:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:02:37,976 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 330 transitions. [2022-11-20 21:02:37,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 26 states have internal predecessors, (99), 14 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2022-11-20 21:02:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 330 transitions. [2022-11-20 21:02:37,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-20 21:02:37,978 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:02:37,978 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-11-20 21:02:37,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-20 21:02:38,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-20 21:02:38,183 INFO L420 AbstractCegarLoop]: === Iteration 35 === 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-11-20 21:02:38,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:02:38,184 INFO L85 PathProgramCache]: Analyzing trace with hash -467489353, now seen corresponding path program 1 times [2022-11-20 21:02:38,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:02:38,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204765492] [2022-11-20 21:02:38,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:02:38,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:02:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:02:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 132 proven. 33 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-20 21:02:41,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:02:41,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204765492] [2022-11-20 21:02:41,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204765492] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:02:41,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107021932] [2022-11-20 21:02:41,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:02:41,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:02:41,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:02:41,619 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:02:41,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 21:02:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:02:42,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-20 21:02:42,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:02:42,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:02:42,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:42,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:42,512 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-11-20 21:02:42,666 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-11-20 21:02:42,670 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5658 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_5658))) is different from true [2022-11-20 21:02:42,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:42,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:42,817 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-11-20 21:02:43,119 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5663 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 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)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5663) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|)) (= |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|) (<= |##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|))) is different from true [2022-11-20 21:02:43,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:43,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:02:43,274 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 29 treesize of output 21 [2022-11-20 21:02:43,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:43,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:43,437 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 23 treesize of output 19 [2022-11-20 21:02:43,447 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5664 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5664))) is different from true [2022-11-20 21:02:43,453 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5664 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_5664))) is different from true [2022-11-20 21:02:46,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:46,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:46,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:46,157 INFO L321 Elim1Store]: treesize reduction 209, result has 20.8 percent of original size [2022-11-20 21:02:46,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 49 treesize of output 81 [2022-11-20 21:02:46,181 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 131 proven. 37 refuted. 0 times theorem prover too weak. 38 trivial. 25 not checked. [2022-11-20 21:02:46,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:02:47,135 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:02:47,136 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-11-20 21:02:47,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:02:47,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:47,150 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 54 treesize of output 42 [2022-11-20 21:02:47,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107021932] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:02:47,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1956192626] [2022-11-20 21:02:47,261 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-20 21:02:47,261 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:02:47,262 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 21:02:47,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:02:47,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25] total 36 [2022-11-20 21:02:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976308031] [2022-11-20 21:02:47,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:02:47,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 21:02:47,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:02:47,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 21:02:47,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=975, Unknown=7, NotChecked=268, Total=1406 [2022-11-20 21:02:47,265 INFO L87 Difference]: Start difference. First operand 294 states and 330 transitions. Second operand has 37 states, 32 states have (on average 3.5) internal successors, (112), 34 states have internal predecessors, (112), 11 states have call successors, (16), 3 states have call predecessors, (16), 9 states have return successors, (17), 12 states have call predecessors, (17), 11 states have call successors, (17) [2022-11-20 21:02:47,619 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (v_ArrVal_5657 Int)) (and (= (select |c_old(#valid)| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 0) (< |##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| v_ArrVal_5657)))) (exists ((|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int)) (and (exists ((v_ArrVal_5664 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_5664))) (= 1 (select |c_#valid| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|)))) (exists ((v_ArrVal_5658 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_5658)))) is different from true [2022-11-20 21:02:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:02:49,627 INFO L93 Difference]: Finished difference Result 326 states and 372 transitions. [2022-11-20 21:02:49,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 21:02:49,627 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 32 states have (on average 3.5) internal successors, (112), 34 states have internal predecessors, (112), 11 states have call successors, (16), 3 states have call predecessors, (16), 9 states have return successors, (17), 12 states have call predecessors, (17), 11 states have call successors, (17) Word has length 124 [2022-11-20 21:02:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:02:49,629 INFO L225 Difference]: With dead ends: 326 [2022-11-20 21:02:49,629 INFO L226 Difference]: Without dead ends: 326 [2022-11-20 21:02:49,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 133 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=310, Invalid=2242, Unknown=18, NotChecked=510, Total=3080 [2022-11-20 21:02:49,630 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 204 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 3078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2189 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 21:02:49,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1242 Invalid, 3078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 823 Invalid, 0 Unknown, 2189 Unchecked, 0.8s Time] [2022-11-20 21:02:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-11-20 21:02:49,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 314. [2022-11-20 21:02:49,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 190 states have (on average 1.5473684210526315) internal successors, (294), 276 states have internal predecessors, (294), 33 states have call successors, (33), 16 states have call predecessors, (33), 19 states have return successors, (28), 24 states have call predecessors, (28), 19 states have call successors, (28) [2022-11-20 21:02:49,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 355 transitions. [2022-11-20 21:02:49,638 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 355 transitions. Word has length 124 [2022-11-20 21:02:49,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:02:49,638 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 355 transitions. [2022-11-20 21:02:49,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 32 states have (on average 3.5) internal successors, (112), 34 states have internal predecessors, (112), 11 states have call successors, (16), 3 states have call predecessors, (16), 9 states have return successors, (17), 12 states have call predecessors, (17), 11 states have call successors, (17) [2022-11-20 21:02:49,639 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 355 transitions. [2022-11-20 21:02:49,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-20 21:02:49,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:02:49,640 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-11-20 21:02:49,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-20 21:02:49,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-20 21:02:49,847 INFO L420 AbstractCegarLoop]: === Iteration 36 === 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-11-20 21:02:49,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:02:49,847 INFO L85 PathProgramCache]: Analyzing trace with hash -467489352, now seen corresponding path program 1 times [2022-11-20 21:02:49,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:02:49,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287540676] [2022-11-20 21:02:49,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:02:49,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:02:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:02:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 132 proven. 52 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-20 21:02:54,443 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:02:54,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287540676] [2022-11-20 21:02:54,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287540676] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:02:54,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770538634] [2022-11-20 21:02:54,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:02:54,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:02:54,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:02:54,447 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:02:54,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 21:02:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:02:55,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 21:02:55,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:02:55,137 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-11-20 21:02:55,340 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-11-20 21:02:55,345 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-11-20 21:02:55,366 WARN L859 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_~#dll~0.base| Int)) (and (exists ((v_ArrVal_6230 Int)) (= (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_6230) |c_#length|)) (exists ((v_ArrVal_6231 Int)) (= |c_#valid| (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_6231))) (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|))) is different from true [2022-11-20 21:02:57,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:57,832 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-11-20 21:02:58,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:58,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:58,288 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 21:02:58,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 21:02:58,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:58,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:58,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:58,800 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-20 21:02:58,801 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-11-20 21:02:59,086 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (v_ArrVal_6239 Int) (v_ArrVal_6238 Int) (v_ArrVal_6233 Int) (v_ArrVal_6232 Int) (v_ArrVal_6231 Int) (v_ArrVal_6230 Int) (v_ArrVal_6241 Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_398| Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_397| Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_399| Int) (|dll_create_generic_~#dll~0.base| Int)) (let ((.cse1 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_6231))) (let ((.cse2 (store .cse1 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_397| 1))) (let ((.cse0 (store .cse2 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_398| 1))) (and (< |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_397| |c_#StackHeapBarrier|) (< |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|) (= (select (store .cse0 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_6232) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_399|) 0) (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_397|) 0) (< |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_398| |c_#StackHeapBarrier|) (= (store (store (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_6230) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_397| v_ArrVal_6241) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_398| v_ArrVal_6239) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_6233) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_399| v_ArrVal_6238) |c_#length|) (< |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_399| |c_#StackHeapBarrier|) (= (select .cse2 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_398|) 0) (= (select .cse0 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 0)))))) is different from true [2022-11-20 21:02:59,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,481 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:02:59,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 40 [2022-11-20 21:02:59,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:59,551 INFO L321 Elim1Store]: treesize reduction 61, result has 24.7 percent of original size [2022-11-20 21:02:59,552 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 158 treesize of output 165 [2022-11-20 21:02:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 132 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 4 not checked. [2022-11-20 21:02:59,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:03:25,260 WARN L233 SmtUtils]: Spent 14.32s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:03:25,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770538634] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:03:25,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1852254972] [2022-11-20 21:03:25,263 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-20 21:03:25,263 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:03:25,263 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 21:03:25,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:03:25,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2022-11-20 21:03:25,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476734501] [2022-11-20 21:03:25,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:03:25,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 21:03:25,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:03:25,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 21:03:25,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1165, Unknown=9, NotChecked=142, Total=1482 [2022-11-20 21:03:25,266 INFO L87 Difference]: Start difference. First operand 314 states and 355 transitions. Second operand has 37 states, 32 states have (on average 3.8125) internal successors, (122), 33 states have internal predecessors, (122), 12 states have call successors, (17), 2 states have call predecessors, (17), 9 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2022-11-20 21:03:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:03:47,090 INFO L93 Difference]: Finished difference Result 333 states and 375 transitions. [2022-11-20 21:03:47,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 21:03:47,090 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 32 states have (on average 3.8125) internal successors, (122), 33 states have internal predecessors, (122), 12 states have call successors, (17), 2 states have call predecessors, (17), 9 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) Word has length 124 [2022-11-20 21:03:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:03:47,092 INFO L225 Difference]: With dead ends: 333 [2022-11-20 21:03:47,092 INFO L226 Difference]: Without dead ends: 333 [2022-11-20 21:03:47,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 131 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 48.5s TimeCoverageRelationStatistics Valid=274, Invalid=2071, Unknown=15, NotChecked=190, Total=2550 [2022-11-20 21:03:47,093 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 132 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 3318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1586 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:03:47,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1205 Invalid, 3318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1698 Invalid, 0 Unknown, 1586 Unchecked, 2.1s Time] [2022-11-20 21:03:47,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-11-20 21:03:47,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 314. [2022-11-20 21:03:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 190 states have (on average 1.5368421052631578) internal successors, (292), 276 states have internal predecessors, (292), 33 states have call successors, (33), 16 states have call predecessors, (33), 19 states have return successors, (28), 24 states have call predecessors, (28), 19 states have call successors, (28) [2022-11-20 21:03:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 353 transitions. [2022-11-20 21:03:47,099 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 353 transitions. Word has length 124 [2022-11-20 21:03:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:03:47,099 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 353 transitions. [2022-11-20 21:03:47,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 32 states have (on average 3.8125) internal successors, (122), 33 states have internal predecessors, (122), 12 states have call successors, (17), 2 states have call predecessors, (17), 9 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2022-11-20 21:03:47,100 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 353 transitions. [2022-11-20 21:03:47,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-20 21:03:47,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:03:47,101 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-11-20 21:03:47,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-20 21:03:47,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-20 21:03:47,307 INFO L420 AbstractCegarLoop]: === Iteration 37 === 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-11-20 21:03:47,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:03:47,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1607248884, now seen corresponding path program 1 times [2022-11-20 21:03:47,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:03:47,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832512394] [2022-11-20 21:03:47,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:03:47,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:03:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:03:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 132 proven. 18 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-20 21:03:50,132 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:03:50,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832512394] [2022-11-20 21:03:50,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832512394] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:03:50,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127523720] [2022-11-20 21:03:50,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:03:50,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:03:50,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:03:50,134 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:03:50,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-20 21:03:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:03:50,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-20 21:03:50,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:03:50,901 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-11-20 21:03:50,951 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-11-20 21:03:51,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:51,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:51,111 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-11-20 21:03:51,121 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_6834 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6834))))) is different from true [2022-11-20 21:03:51,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:51,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:51,305 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-11-20 21:03:51,469 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-11-20 21:03:51,474 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6835 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_6835))) is different from true [2022-11-20 21:03:53,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:53,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:53,801 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-11-20 21:03:54,103 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6840 (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)) (= |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_6840) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-20 21:03:56,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:56,296 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-11-20 21:03:56,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:56,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:56,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:56,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:56,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:56,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:56,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:56,920 INFO L321 Elim1Store]: treesize reduction 119, result has 29.2 percent of original size [2022-11-20 21:03:56,920 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-11-20 21:03:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 144 proven. 30 refuted. 0 times theorem prover too weak. 23 trivial. 35 not checked. [2022-11-20 21:03:57,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:03:57,725 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:03:57,725 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-11-20 21:03:57,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:03:57,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 57 treesize of output 45 [2022-11-20 21:03:57,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127523720] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:03:57,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [769288462] [2022-11-20 21:03:57,868 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-20 21:03:57,868 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:03:57,868 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 21:03:57,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:03:57,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 28] total 38 [2022-11-20 21:03:57,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386037950] [2022-11-20 21:03:57,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:03:57,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-20 21:03:57,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:03:57,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-20 21:03:57,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1186, Unknown=6, NotChecked=216, Total=1560 [2022-11-20 21:03:57,872 INFO L87 Difference]: Start difference. First operand 314 states and 353 transitions. Second operand has 39 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 34 states have internal predecessors, (111), 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-11-20 21:03:58,966 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6835 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_6835))) (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_6833 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6833))) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0))) (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_6834 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6834)))))) is different from true [2022-11-20 21:04:02,234 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6835 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_6835))) (exists ((v_ArrVal_6840 (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)) (= (select |c_#valid| (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6840) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)) 1) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) (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_6834 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6834)))))) is different from true [2022-11-20 21:04:11,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:04:11,434 INFO L93 Difference]: Finished difference Result 323 states and 366 transitions. [2022-11-20 21:04:11,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-20 21:04:11,434 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 34 states have internal predecessors, (111), 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-11-20 21:04:11,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:04:11,436 INFO L225 Difference]: With dead ends: 323 [2022-11-20 21:04:11,436 INFO L226 Difference]: Without dead ends: 323 [2022-11-20 21:04:11,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=333, Invalid=3095, Unknown=14, NotChecked=590, Total=4032 [2022-11-20 21:04:11,437 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 237 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 1574 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 3373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1727 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-20 21:04:11,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1609 Invalid, 3373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1574 Invalid, 0 Unknown, 1727 Unchecked, 3.5s Time] [2022-11-20 21:04:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-20 21:04:11,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 316. [2022-11-20 21:04:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 192 states have (on average 1.5364583333333333) internal successors, (295), 277 states have internal predecessors, (295), 33 states have call successors, (33), 16 states have call predecessors, (33), 19 states have return successors, (28), 25 states have call predecessors, (28), 19 states have call successors, (28) [2022-11-20 21:04:11,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 356 transitions. [2022-11-20 21:04:11,444 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 356 transitions. Word has length 125 [2022-11-20 21:04:11,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:04:11,445 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 356 transitions. [2022-11-20 21:04:11,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 34 states have internal predecessors, (111), 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-11-20 21:04:11,445 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 356 transitions. [2022-11-20 21:04:11,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-20 21:04:11,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:04:11,446 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, 1] [2022-11-20 21:04:11,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-20 21:04:11,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:04:11,655 INFO L420 AbstractCegarLoop]: === Iteration 38 === 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-11-20 21:04:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:04:11,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1767471000, now seen corresponding path program 2 times [2022-11-20 21:04:11,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:04:11,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674156689] [2022-11-20 21:04:11,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:04:11,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:04:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:04:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-20 21:04:14,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:04:14,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674156689] [2022-11-20 21:04:14,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674156689] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:04:14,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974045668] [2022-11-20 21:04:14,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:04:14,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:04:14,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:04:14,264 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:04:14,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-20 21:04:18,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 21:04:18,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:04:18,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 21:04:18,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:04:18,629 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-11-20 21:04:18,662 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_7213 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_7213))))) is different from true [2022-11-20 21:04:22,764 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7214 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_7214))) (< |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|)) is different from true [2022-11-20 21:04:22,775 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int) (v_ArrVal_7214 Int)) (and (< |##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| v_ArrVal_7214)))) is different from true [2022-11-20 21:04:30,911 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_7215 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_7215))))) is different from true [2022-11-20 21:04:41,131 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_7216 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_7216))) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-20 21:05:15,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:15,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:15,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:15,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:15,758 INFO L321 Elim1Store]: treesize reduction 148, result has 30.2 percent of original size [2022-11-20 21:05:15,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 75 [2022-11-20 21:05:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 51 not checked. [2022-11-20 21:05:15,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:16,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974045668] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:16,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1119325334] [2022-11-20 21:05:16,195 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-20 21:05:16,195 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:05:16,195 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 21:05:16,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:05:16,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 27 [2022-11-20 21:05:16,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720023400] [2022-11-20 21:05:16,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:16,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 21:05:16,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:16,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 21:05:16,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=445, Unknown=33, NotChecked=240, Total=812 [2022-11-20 21:05:16,197 INFO L87 Difference]: Start difference. First operand 316 states and 356 transitions. Second operand has 28 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 24 states have internal predecessors, (76), 12 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-20 21:05:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:47,143 INFO L93 Difference]: Finished difference Result 331 states and 374 transitions. [2022-11-20 21:05:47,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 21:05:47,144 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 24 states have internal predecessors, (76), 12 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) Word has length 76 [2022-11-20 21:05:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:47,145 INFO L225 Difference]: With dead ends: 331 [2022-11-20 21:05:47,145 INFO L226 Difference]: Without dead ends: 331 [2022-11-20 21:05:47,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 83 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 86.2s TimeCoverageRelationStatistics Valid=189, Invalid=1117, Unknown=46, NotChecked=370, Total=1722 [2022-11-20 21:05:47,146 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 173 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 1648 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 3465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1772 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:47,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1584 Invalid, 3465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1648 Invalid, 0 Unknown, 1772 Unchecked, 2.1s Time] [2022-11-20 21:05:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-11-20 21:05:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 320. [2022-11-20 21:05:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 196 states have (on average 1.5561224489795917) internal successors, (305), 280 states have internal predecessors, (305), 33 states have call successors, (33), 16 states have call predecessors, (33), 19 states have return successors, (27), 26 states have call predecessors, (27), 19 states have call successors, (27) [2022-11-20 21:05:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 365 transitions. [2022-11-20 21:05:47,153 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 365 transitions. Word has length 76 [2022-11-20 21:05:47,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:47,154 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 365 transitions. [2022-11-20 21:05:47,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 24 states have internal predecessors, (76), 12 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-20 21:05:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 365 transitions. [2022-11-20 21:05:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-20 21:05:47,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:47,156 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-11-20 21:05:47,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:47,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-20 21:05:47,363 INFO L420 AbstractCegarLoop]: === Iteration 39 === 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-11-20 21:05:47,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:47,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1607248883, now seen corresponding path program 1 times [2022-11-20 21:05:47,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:47,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270628521] [2022-11-20 21:05:47,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:47,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 132 proven. 68 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-20 21:05:51,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:51,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270628521] [2022-11-20 21:05:51,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270628521] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:51,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878925699] [2022-11-20 21:05:51,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:51,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:51,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:51,338 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:51,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-20 21:05:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:52,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-20 21:05:52,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:52,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:52,508 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-11-20 21:05:52,668 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-11-20 21:05:52,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-11-20 21:05:52,744 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-11-20 21:05:53,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:53,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:53,023 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-11-20 21:05:53,033 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_7798 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_7798) |c_#length|)))) is different from true [2022-11-20 21:05:53,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:53,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:53,287 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-11-20 21:05:53,296 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_7799 Int)) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_7799))))) is different from true [2022-11-20 21:05:57,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:57,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:57,608 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-11-20 21:05:57,617 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_7800 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_7800) |c_#length|)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-20 21:06:04,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:04,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:04,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:04,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:04,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:04,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:04,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:04,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:04,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:04,172 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 21:06:04,172 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-11-20 21:06:04,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:04,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:04,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:04,202 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 21:06:04,203 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-11-20 21:06:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 115 proven. 41 refuted. 0 times theorem prover too weak. 19 trivial. 57 not checked. [2022-11-20 21:06:04,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:06:13,014 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-11-20 21:06:13,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878925699] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:06:13,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1722752538] [2022-11-20 21:06:13,016 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-20 21:06:13,017 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:06:13,017 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 21:06:13,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:06:13,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 44 [2022-11-20 21:06:13,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902697860] [2022-11-20 21:06:13,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:06:13,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-20 21:06:13,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:13,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-20 21:06:13,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1646, Unknown=8, NotChecked=252, Total=2070 [2022-11-20 21:06:13,019 INFO L87 Difference]: Start difference. First operand 320 states and 365 transitions. Second operand has 45 states, 36 states have (on average 4.083333333333333) internal successors, (147), 38 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-11-20 21:06:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:32,313 INFO L93 Difference]: Finished difference Result 324 states and 368 transitions. [2022-11-20 21:06:32,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 21:06:32,313 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 36 states have (on average 4.083333333333333) internal successors, (147), 38 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-11-20 21:06:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:32,315 INFO L225 Difference]: With dead ends: 324 [2022-11-20 21:06:32,315 INFO L226 Difference]: Without dead ends: 324 [2022-11-20 21:06:32,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=412, Invalid=4009, Unknown=13, NotChecked=396, Total=4830 [2022-11-20 21:06:32,316 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 330 mSDsluCounter, 2548 mSDsCounter, 0 mSdLazyCounter, 3583 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 5413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 3583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1729 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:32,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 2690 Invalid, 5413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 3583 Invalid, 0 Unknown, 1729 Unchecked, 3.8s Time] [2022-11-20 21:06:32,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-11-20 21:06:32,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 316. [2022-11-20 21:06:32,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 192 states have (on average 1.5572916666666667) internal successors, (299), 278 states have internal predecessors, (299), 33 states have call successors, (33), 16 states have call predecessors, (33), 19 states have return successors, (27), 24 states have call predecessors, (27), 19 states have call successors, (27) [2022-11-20 21:06:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 359 transitions. [2022-11-20 21:06:32,324 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 359 transitions. Word has length 125 [2022-11-20 21:06:32,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:32,324 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 359 transitions. [2022-11-20 21:06:32,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 36 states have (on average 4.083333333333333) internal successors, (147), 38 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-11-20 21:06:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 359 transitions. [2022-11-20 21:06:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-20 21:06:32,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:32,326 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, 1] [2022-11-20 21:06:32,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-20 21:06:32,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-20 21:06:32,535 INFO L420 AbstractCegarLoop]: === Iteration 40 === 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-11-20 21:06:32,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:32,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1767470999, now seen corresponding path program 2 times [2022-11-20 21:06:32,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:32,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98968995] [2022-11-20 21:06:32,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:32,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 21:06:40,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:40,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98968995] [2022-11-20 21:06:40,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98968995] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:06:40,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495563848] [2022-11-20 21:06:40,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:06:40,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:40,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:06:40,463 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:06:40,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-20 21:06:49,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 21:06:49,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:06:49,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-20 21:06:49,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:06:50,194 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-11-20 21:06:50,199 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-11-20 21:06:50,338 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_8168 Int)) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_8168))))) is different from true [2022-11-20 21:06:58,849 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8169 Int)) (= |c_#length| (store |c_old(#length)| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_8169))) is different from true [2022-11-20 21:07:10,162 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_8170 Int)) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_8170))) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-20 21:07:27,538 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_8171 Int)) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_8171))))) is different from true [2022-11-20 21:07:48,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:07:48,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:07:48,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:07:48,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:07:48,225 INFO L321 Elim1Store]: treesize reduction 140, result has 31.4 percent of original size [2022-11-20 21:07:48,225 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 5 case distinctions, treesize of input 26 treesize of output 74 [2022-11-20 21:07:48,245 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 21:07:48,246 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-11-20 21:07:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 51 not checked. [2022-11-20 21:07:48,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:07:49,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495563848] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:07:49,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1148932332] [2022-11-20 21:07:49,643 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-20 21:07:49,643 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:07:49,643 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 21:07:49,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:07:49,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 21] total 61 [2022-11-20 21:07:49,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427705803] [2022-11-20 21:07:49,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:07:49,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-20 21:07:49,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:07:49,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-20 21:07:49,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=3261, Unknown=33, NotChecked=476, Total=4032 [2022-11-20 21:07:49,645 INFO L87 Difference]: Start difference. First operand 316 states and 359 transitions. Second operand has 62 states, 55 states have (on average 2.090909090909091) internal successors, (115), 53 states have internal predecessors, (115), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-20 21:08:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:08:58,818 INFO L93 Difference]: Finished difference Result 333 states and 371 transitions. [2022-11-20 21:08:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-20 21:08:58,819 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 55 states have (on average 2.090909090909091) internal successors, (115), 53 states have internal predecessors, (115), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Word has length 76 [2022-11-20 21:08:58,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:08:58,820 INFO L225 Difference]: With dead ends: 333 [2022-11-20 21:08:58,820 INFO L226 Difference]: Without dead ends: 333 [2022-11-20 21:08:58,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 94 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1923 ImplicationChecksByTransitivity, 126.6s TimeCoverageRelationStatistics Valid=796, Invalid=7531, Unknown=61, NotChecked=732, Total=9120 [2022-11-20 21:08:58,821 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 325 mSDsluCounter, 2540 mSDsCounter, 0 mSdLazyCounter, 3211 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 2689 SdHoareTripleChecker+Invalid, 5764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 3211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2430 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-20 21:08:58,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 2689 Invalid, 5764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 3211 Invalid, 0 Unknown, 2430 Unchecked, 4.8s Time] [2022-11-20 21:08:58,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-11-20 21:08:58,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 310. [2022-11-20 21:08:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 188 states have (on average 1.5638297872340425) internal successors, (294), 274 states have internal predecessors, (294), 33 states have call successors, (33), 16 states have call predecessors, (33), 17 states have return successors, (23), 22 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-20 21:08:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 350 transitions. [2022-11-20 21:08:58,828 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 350 transitions. Word has length 76 [2022-11-20 21:08:58,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:08:58,829 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 350 transitions. [2022-11-20 21:08:58,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 55 states have (on average 2.090909090909091) internal successors, (115), 53 states have internal predecessors, (115), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-20 21:08:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 350 transitions. [2022-11-20 21:08:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-20 21:08:58,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:08:58,831 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] [2022-11-20 21:08:58,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-20 21:08:59,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-20 21:08:59,044 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-20 21:08:59,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:08:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1321471701, now seen corresponding path program 1 times [2022-11-20 21:08:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:08:59,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075497198] [2022-11-20 21:08:59,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:08:59,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:08:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:08:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-20 21:08:59,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:08:59,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075497198] [2022-11-20 21:08:59,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075497198] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:08:59,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083681116] [2022-11-20 21:08:59,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:08:59,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:08:59,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:08:59,547 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:08:59,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-20 21:09:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:09:00,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 1164 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-20 21:09:00,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:09:00,389 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-11-20 21:09:00,429 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-11-20 21:09:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 33 proven. 5 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-11-20 21:09:00,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:09:00,844 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-11-20 21:09:00,857 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-11-20 21:09:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-20 21:09:01,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083681116] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:09:01,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1189694925] [2022-11-20 21:09:01,014 INFO L159 IcfgInterpreter]: Started Sifa with 43 locations of interest [2022-11-20 21:09:01,015 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:09:01,015 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 21:09:01,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:09:01,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 15 [2022-11-20 21:09:01,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814313992] [2022-11-20 21:09:01,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:09:01,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 21:09:01,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:09:01,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 21:09:01,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-20 21:09:01,018 INFO L87 Difference]: Start difference. First operand 310 states and 350 transitions. Second operand has 15 states, 11 states have (on average 4.636363636363637) internal successors, (51), 13 states have internal predecessors, (51), 6 states have call successors, (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-11-20 21:09:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:09:01,853 INFO L93 Difference]: Finished difference Result 410 states and 462 transitions. [2022-11-20 21:09:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 21:09:01,854 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 4.636363636363637) internal successors, (51), 13 states have internal predecessors, (51), 6 states have call successors, (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 110 [2022-11-20 21:09:01,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:09:01,856 INFO L225 Difference]: With dead ends: 410 [2022-11-20 21:09:01,856 INFO L226 Difference]: Without dead ends: 410 [2022-11-20 21:09:01,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-11-20 21:09:01,856 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 152 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 21:09:01,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 2134 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 21:09:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-11-20 21:09:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 335. [2022-11-20 21:09:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 212 states have (on average 1.6132075471698113) internal successors, (342), 297 states have internal predecessors, (342), 33 states have call successors, (33), 17 states have call predecessors, (33), 18 states have return successors, (23), 22 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-20 21:09:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 398 transitions. [2022-11-20 21:09:01,867 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 398 transitions. Word has length 110 [2022-11-20 21:09:01,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:09:01,867 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 398 transitions. [2022-11-20 21:09:01,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 4.636363636363637) internal successors, (51), 13 states have internal predecessors, (51), 6 states have call successors, (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-11-20 21:09:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 398 transitions. [2022-11-20 21:09:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-20 21:09:01,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:09:01,869 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] [2022-11-20 21:09:01,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-20 21:09:02,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-11-20 21:09:02,069 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting inspect_baseErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-20 21:09:02,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:09:02,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1321483319, now seen corresponding path program 1 times [2022-11-20 21:09:02,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:09:02,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610372547] [2022-11-20 21:09:02,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:09:02,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:09:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:09:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-11-20 21:09:02,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:09:02,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610372547] [2022-11-20 21:09:02,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610372547] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:09:02,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945562230] [2022-11-20 21:09:02,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:09:02,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:09:02,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:09:02,995 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:09:02,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-20 21:09:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:09:03,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-20 21:09:03,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:09:04,063 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-11-20 21:09:04,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:09:04,219 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-11-20 21:09:04,223 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-11-20 21:09:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 33 proven. 5 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-11-20 21:09:04,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:09:04,744 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-11-20 21:09:04,926 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-11-20 21:09:04,935 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 21:09:04,935 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-11-20 21:09:05,050 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-11-20 21:09:05,069 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-11-20 21:09:05,180 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-11-20 21:09:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 33 proven. 5 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-11-20 21:09:05,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945562230] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:09:05,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1748582407] [2022-11-20 21:09:05,436 INFO L159 IcfgInterpreter]: Started Sifa with 43 locations of interest [2022-11-20 21:09:05,436 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:09:05,436 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 21:09:05,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:09:05,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 35 [2022-11-20 21:09:05,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115366490] [2022-11-20 21:09:05,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:09:05,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 21:09:05,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:09:05,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 21:09:05,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1165, Unknown=0, NotChecked=0, Total=1260 [2022-11-20 21:09:05,439 INFO L87 Difference]: Start difference. First operand 335 states and 398 transitions. Second operand has 36 states, 25 states have (on average 3.64) internal successors, (91), 32 states have internal predecessors, (91), 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-11-20 21:09:08,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:09:08,766 INFO L93 Difference]: Finished difference Result 348 states and 393 transitions. [2022-11-20 21:09:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 21:09:08,766 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 25 states have (on average 3.64) internal successors, (91), 32 states have internal predecessors, (91), 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 110 [2022-11-20 21:09:08,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:09:08,769 INFO L225 Difference]: With dead ends: 348 [2022-11-20 21:09:08,769 INFO L226 Difference]: Without dead ends: 348 [2022-11-20 21:09:08,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=292, Invalid=2900, Unknown=0, NotChecked=0, Total=3192 [2022-11-20 21:09:08,769 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 372 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 3959 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 2144 SdHoareTripleChecker+Invalid, 4046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-20 21:09:08,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 2144 Invalid, 4046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3959 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-20 21:09:08,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-11-20 21:09:08,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 330. [2022-11-20 21:09:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 213 states have (on average 1.5586854460093897) internal successors, (332), 292 states have internal predecessors, (332), 33 states have call successors, (33), 17 states have call predecessors, (33), 18 states have return successors, (23), 22 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-20 21:09:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 388 transitions. [2022-11-20 21:09:08,777 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 388 transitions. Word has length 110 [2022-11-20 21:09:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:09:08,777 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 388 transitions. [2022-11-20 21:09:08,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 25 states have (on average 3.64) internal successors, (91), 32 states have internal predecessors, (91), 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-11-20 21:09:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 388 transitions. [2022-11-20 21:09:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-20 21:09:08,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:09:08,779 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] [2022-11-20 21:09:08,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-20 21:09:08,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:09:08,989 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting inspect_baseErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-20 21:09:08,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:09:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1321483318, now seen corresponding path program 1 times [2022-11-20 21:09:08,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:09:08,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974486677] [2022-11-20 21:09:08,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:09:08,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:09:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:09:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-20 21:09:09,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:09:09,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974486677] [2022-11-20 21:09:09,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974486677] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:09:09,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545632034] [2022-11-20 21:09:09,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:09:09,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:09:09,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:09:09,900 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:09:09,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-20 21:09:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:09:10,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-20 21:09:10,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:09:10,788 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-11-20 21:09:10,794 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-11-20 21:09:10,866 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-11-20 21:09:10,868 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-11-20 21:09:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 33 proven. 5 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-11-20 21:09:10,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:09:11,802 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-11-20 21:09:11,805 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-11-20 21:09:11,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:09:11,817 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-11-20 21:09:11,880 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-11-20 21:09:11,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:09:11,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:09:11,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:09:11,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:09:11,946 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-11-20 21:09:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-20 21:09:12,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545632034] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:09:12,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [591111425] [2022-11-20 21:09:12,199 INFO L159 IcfgInterpreter]: Started Sifa with 43 locations of interest [2022-11-20 21:09:12,199 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:09:12,199 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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-11-20 21:09:12,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:09:12,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 27 [2022-11-20 21:09:12,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160115682] [2022-11-20 21:09:12,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:09:12,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 21:09:12,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:09:12,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 21:09:12,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-11-20 21:09:12,201 INFO L87 Difference]: Start difference. First operand 330 states and 388 transitions. Second operand has 28 states, 20 states have (on average 3.55) internal successors, (71), 24 states have internal predecessors, (71), 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-11-20 21:09:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:09:13,834 INFO L93 Difference]: Finished difference Result 390 states and 442 transitions. [2022-11-20 21:09:13,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 21:09:13,834 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 20 states have (on average 3.55) internal successors, (71), 24 states have internal predecessors, (71), 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 110 [2022-11-20 21:09:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:09:13,837 INFO L225 Difference]: With dead ends: 390 [2022-11-20 21:09:13,837 INFO L226 Difference]: Without dead ends: 390 [2022-11-20 21:09:13,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2022-11-20 21:09:13,837 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 238 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 21:09:13,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 2084 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-20 21:09:13,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-20 21:09:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 352. [2022-11-20 21:09:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 236 states have (on average 1.5889830508474576) internal successors, (375), 314 states have internal predecessors, (375), 33 states have call successors, (33), 17 states have call predecessors, (33), 18 states have return successors, (23), 22 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-20 21:09:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 431 transitions. [2022-11-20 21:09:13,845 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 431 transitions. Word has length 110 [2022-11-20 21:09:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:09:13,846 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 431 transitions. [2022-11-20 21:09:13,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 20 states have (on average 3.55) internal successors, (71), 24 states have internal predecessors, (71), 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-11-20 21:09:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 431 transitions. [2022-11-20 21:09:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-20 21:09:13,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:09:13,848 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-11-20 21:09:13,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-20 21:09:14,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ef784b-9c4e-42d8-ad33-dd1bc99b2ae6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:09:14,058 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-20 21:09:14,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:09:14,058 INFO L85 PathProgramCache]: Analyzing trace with hash -639195791, now seen corresponding path program 1 times [2022-11-20 21:09:14,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:09:14,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222241784] [2022-11-20 21:09:14,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:09:14,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:09:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat