./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 4e7fbc69 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_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/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_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW --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-4e7fbc6 [2022-11-23 13:52:39,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 13:52:39,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 13:52:39,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 13:52:39,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 13:52:39,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 13:52:39,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 13:52:39,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 13:52:39,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 13:52:39,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 13:52:39,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 13:52:39,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 13:52:39,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 13:52:39,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 13:52:39,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 13:52:39,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 13:52:39,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 13:52:39,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 13:52:39,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 13:52:39,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 13:52:39,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 13:52:39,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 13:52:39,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 13:52:39,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 13:52:39,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 13:52:39,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 13:52:39,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 13:52:39,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 13:52:39,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 13:52:39,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 13:52:39,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 13:52:39,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 13:52:39,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 13:52:39,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 13:52:39,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 13:52:39,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 13:52:39,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 13:52:39,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 13:52:39,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 13:52:39,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 13:52:39,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 13:52:39,139 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-11-23 13:52:39,187 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 13:52:39,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 13:52:39,188 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 13:52:39,189 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 13:52:39,190 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 13:52:39,190 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 13:52:39,190 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 13:52:39,191 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 13:52:39,191 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 13:52:39,191 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 13:52:39,192 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 13:52:39,193 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 13:52:39,193 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 13:52:39,193 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 13:52:39,193 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 13:52:39,194 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 13:52:39,194 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 13:52:39,194 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 13:52:39,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 13:52:39,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 13:52:39,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 13:52:39,196 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 13:52:39,196 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 13:52:39,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 13:52:39,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 13:52:39,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 13:52:39,198 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 13:52:39,198 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 13:52:39,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 13:52:39,199 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 13:52:39,199 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 13:52:39,200 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 13:52:39,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 13:52:39,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 13:52:39,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:52:39,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 13:52:39,201 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 13:52:39,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 13:52:39,202 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 13:52:39,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 13:52:39,202 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 13:52:39,203 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_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/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_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW 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-23 13:52:39,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 13:52:39,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 13:52:39,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 13:52:39,581 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 13:52:39,581 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 13:52:39,583 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2022-11-23 13:52:42,899 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 13:52:43,268 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 13:52:43,268 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2022-11-23 13:52:43,283 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/data/71533d2f8/07fad56b81704bb3afeac013037721ca/FLAG510cbddbc [2022-11-23 13:52:43,301 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/data/71533d2f8/07fad56b81704bb3afeac013037721ca [2022-11-23 13:52:43,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 13:52:43,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 13:52:43,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 13:52:43,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 13:52:43,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 13:52:43,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:43" (1/1) ... [2022-11-23 13:52:43,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@187dd13d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:43, skipping insertion in model container [2022-11-23 13:52:43,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:43" (1/1) ... [2022-11-23 13:52:43,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 13:52:43,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 13:52:43,776 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_1768a35a-6d7d-439a-911c-86d35696ce3f/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2022-11-23 13:52:43,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:52:43,893 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 13:52:43,943 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_1768a35a-6d7d-439a-911c-86d35696ce3f/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2022-11-23 13:52:43,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:52:44,039 INFO L208 MainTranslator]: Completed translation [2022-11-23 13:52:44,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:44 WrapperNode [2022-11-23 13:52:44,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 13:52:44,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 13:52:44,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 13:52:44,041 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 13:52:44,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:44" (1/1) ... [2022-11-23 13:52:44,087 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:44" (1/1) ... [2022-11-23 13:52:44,123 INFO L138 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 234 [2022-11-23 13:52:44,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 13:52:44,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 13:52:44,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 13:52:44,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 13:52:44,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:44" (1/1) ... [2022-11-23 13:52:44,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:44" (1/1) ... [2022-11-23 13:52:44,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:44" (1/1) ... [2022-11-23 13:52:44,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:44" (1/1) ... [2022-11-23 13:52:44,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:44" (1/1) ... [2022-11-23 13:52:44,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:44" (1/1) ... [2022-11-23 13:52:44,228 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:44" (1/1) ... [2022-11-23 13:52:44,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:44" (1/1) ... [2022-11-23 13:52:44,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 13:52:44,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 13:52:44,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 13:52:44,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 13:52:44,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:44" (1/1) ... [2022-11-23 13:52:44,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:52:44,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:52:44,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 13:52:44,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 13:52:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-11-23 13:52:44,344 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-11-23 13:52:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2022-11-23 13:52:44,344 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2022-11-23 13:52:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 13:52:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 13:52:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2022-11-23 13:52:44,345 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2022-11-23 13:52:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 13:52:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 13:52:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-23 13:52:44,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-23 13:52:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 13:52:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 13:52:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-23 13:52:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2022-11-23 13:52:44,346 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2022-11-23 13:52:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2022-11-23 13:52:44,347 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2022-11-23 13:52:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 13:52:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 13:52:44,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 13:52:44,556 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 13:52:44,573 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 13:52:45,445 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 13:52:45,576 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 13:52:45,583 INFO L300 CfgBuilder]: Removed 38 assume(true) statements. [2022-11-23 13:52:45,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:45 BoogieIcfgContainer [2022-11-23 13:52:45,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 13:52:45,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 13:52:45,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 13:52:45,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 13:52:45,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:52:43" (1/3) ... [2022-11-23 13:52:45,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bbb9f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:45, skipping insertion in model container [2022-11-23 13:52:45,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:44" (2/3) ... [2022-11-23 13:52:45,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bbb9f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:45, skipping insertion in model container [2022-11-23 13:52:45,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:45" (3/3) ... [2022-11-23 13:52:45,603 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2022-11-23 13:52:45,622 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 13:52:45,622 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2022-11-23 13:52:45,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 13:52:45,717 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;@7963574e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 13:52:45,718 INFO L358 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2022-11-23 13:52:45,724 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-23 13:52:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 13:52:45,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:45,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:45,736 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-23 13:52:45,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:45,744 INFO L85 PathProgramCache]: Analyzing trace with hash 691826204, now seen corresponding path program 1 times [2022-11-23 13:52:45,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:45,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448933989] [2022-11-23 13:52:45,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:45,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:46,041 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-23 13:52:46,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:46,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448933989] [2022-11-23 13:52:46,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448933989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:46,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:46,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 13:52:46,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768013890] [2022-11-23 13:52:46,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:46,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:52:46,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:46,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:52:46,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:52:46,080 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-23 13:52:46,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:46,354 INFO L93 Difference]: Finished difference Result 231 states and 263 transitions. [2022-11-23 13:52:46,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:52:46,359 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-23 13:52:46,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:46,374 INFO L225 Difference]: With dead ends: 231 [2022-11-23 13:52:46,374 INFO L226 Difference]: Without dead ends: 230 [2022-11-23 13:52:46,376 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-23 13:52:46,383 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.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:46,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 355 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:52:46,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-23 13:52:46,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2022-11-23 13:52:46,462 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-23 13:52:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 258 transitions. [2022-11-23 13:52:46,474 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 258 transitions. Word has length 7 [2022-11-23 13:52:46,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:46,475 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 258 transitions. [2022-11-23 13:52:46,475 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-23 13:52:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 258 transitions. [2022-11-23 13:52:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 13:52:46,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:46,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:46,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 13:52:46,477 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-23 13:52:46,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:46,477 INFO L85 PathProgramCache]: Analyzing trace with hash 691826205, now seen corresponding path program 1 times [2022-11-23 13:52:46,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:46,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121742256] [2022-11-23 13:52:46,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:46,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:46,662 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-23 13:52:46,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:46,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121742256] [2022-11-23 13:52:46,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121742256] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:46,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:46,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 13:52:46,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430172771] [2022-11-23 13:52:46,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:46,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:52:46,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:46,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:52:46,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:52:46,667 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-23 13:52:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:46,890 INFO L93 Difference]: Finished difference Result 228 states and 260 transitions. [2022-11-23 13:52:46,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:52:46,890 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-23 13:52:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:46,892 INFO L225 Difference]: With dead ends: 228 [2022-11-23 13:52:46,892 INFO L226 Difference]: Without dead ends: 228 [2022-11-23 13:52:46,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:52:46,894 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 17 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:46,895 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-23 13:52:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-23 13:52:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2022-11-23 13:52:46,904 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-23 13:52:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 256 transitions. [2022-11-23 13:52:46,906 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 256 transitions. Word has length 7 [2022-11-23 13:52:46,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:46,907 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 256 transitions. [2022-11-23 13:52:46,907 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-23 13:52:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 256 transitions. [2022-11-23 13:52:46,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 13:52:46,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:46,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:46,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 13:52:46,908 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-23 13:52:46,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:46,909 INFO L85 PathProgramCache]: Analyzing trace with hash -892161265, now seen corresponding path program 1 times [2022-11-23 13:52:46,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:46,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421706275] [2022-11-23 13:52:46,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:46,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:46,994 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-23 13:52:46,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:46,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421706275] [2022-11-23 13:52:46,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421706275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:46,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:46,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 13:52:46,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303062575] [2022-11-23 13:52:46,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:46,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:52:46,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:46,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:52:46,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:52:46,997 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-23 13:52:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:47,209 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2022-11-23 13:52:47,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:52:47,210 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-23 13:52:47,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:47,211 INFO L225 Difference]: With dead ends: 223 [2022-11-23 13:52:47,211 INFO L226 Difference]: Without dead ends: 223 [2022-11-23 13:52:47,212 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-23 13:52:47,213 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 17 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-23 13:52:47,213 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-23 13:52:47,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-23 13:52:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2022-11-23 13:52:47,222 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-23 13:52:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2022-11-23 13:52:47,224 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 9 [2022-11-23 13:52:47,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:47,224 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2022-11-23 13:52:47,224 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-23 13:52:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2022-11-23 13:52:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 13:52:47,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:47,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:47,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 13:52:47,225 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-23 13:52:47,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:47,226 INFO L85 PathProgramCache]: Analyzing trace with hash -892161264, now seen corresponding path program 1 times [2022-11-23 13:52:47,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:47,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251722831] [2022-11-23 13:52:47,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:47,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:47,316 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-23 13:52:47,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:47,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251722831] [2022-11-23 13:52:47,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251722831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:47,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:47,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 13:52:47,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697217262] [2022-11-23 13:52:47,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:47,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:52:47,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:47,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:52:47,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:52:47,319 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-23 13:52:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:47,518 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2022-11-23 13:52:47,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:52:47,519 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-23 13:52:47,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:47,521 INFO L225 Difference]: With dead ends: 220 [2022-11-23 13:52:47,521 INFO L226 Difference]: Without dead ends: 220 [2022-11-23 13:52:47,521 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-23 13:52:47,522 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.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:47,523 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.2s Time] [2022-11-23 13:52:47,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-23 13:52:47,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-11-23 13:52:47,541 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-23 13:52:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 250 transitions. [2022-11-23 13:52:47,543 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 250 transitions. Word has length 9 [2022-11-23 13:52:47,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:47,543 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 250 transitions. [2022-11-23 13:52:47,543 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-23 13:52:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 250 transitions. [2022-11-23 13:52:47,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 13:52:47,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:47,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:47,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 13:52:47,545 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-23 13:52:47,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:47,545 INFO L85 PathProgramCache]: Analyzing trace with hash -874929520, now seen corresponding path program 1 times [2022-11-23 13:52:47,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:47,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038173981] [2022-11-23 13:52:47,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:47,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:47,808 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-23 13:52:47,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:47,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038173981] [2022-11-23 13:52:47,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038173981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:47,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:47,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:52:47,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455181733] [2022-11-23 13:52:47,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:47,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:52:47,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:47,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:52:47,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:52:47,812 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-23 13:52:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:48,085 INFO L93 Difference]: Finished difference Result 242 states and 280 transitions. [2022-11-23 13:52:48,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:52:48,086 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-23 13:52:48,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:48,088 INFO L225 Difference]: With dead ends: 242 [2022-11-23 13:52:48,088 INFO L226 Difference]: Without dead ends: 242 [2022-11-23 13:52:48,089 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-23 13:52:48,090 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 15 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-23 13:52:48,095 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-23 13:52:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-23 13:52:48,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236. [2022-11-23 13:52:48,113 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-23 13:52:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 276 transitions. [2022-11-23 13:52:48,116 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 276 transitions. Word has length 9 [2022-11-23 13:52:48,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:48,116 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 276 transitions. [2022-11-23 13:52:48,117 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-23 13:52:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 276 transitions. [2022-11-23 13:52:48,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 13:52:48,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:48,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:48,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 13:52:48,119 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-23 13:52:48,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:48,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1118615216, now seen corresponding path program 1 times [2022-11-23 13:52:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:48,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646719865] [2022-11-23 13:52:48,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:48,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:48,436 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-23 13:52:48,436 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:48,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646719865] [2022-11-23 13:52:48,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646719865] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:48,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:48,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 13:52:48,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303631007] [2022-11-23 13:52:48,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:48,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 13:52:48,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:48,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 13:52:48,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 13:52:48,443 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-23 13:52:49,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:49,030 INFO L93 Difference]: Finished difference Result 255 states and 298 transitions. [2022-11-23 13:52:49,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 13:52:49,031 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-23 13:52:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:49,033 INFO L225 Difference]: With dead ends: 255 [2022-11-23 13:52:49,033 INFO L226 Difference]: Without dead ends: 255 [2022-11-23 13:52:49,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-23 13:52:49,035 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 92 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:49,035 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.5s Time] [2022-11-23 13:52:49,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-23 13:52:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 245. [2022-11-23 13:52:49,045 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-23 13:52:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 288 transitions. [2022-11-23 13:52:49,047 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 288 transitions. Word has length 12 [2022-11-23 13:52:49,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:49,048 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 288 transitions. [2022-11-23 13:52:49,048 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-23 13:52:49,048 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 288 transitions. [2022-11-23 13:52:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 13:52:49,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:49,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:49,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 13:52:49,050 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-23 13:52:49,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:49,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1118615215, now seen corresponding path program 1 times [2022-11-23 13:52:49,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:49,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852325131] [2022-11-23 13:52:49,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:49,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:49,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-23 13:52:49,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:49,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852325131] [2022-11-23 13:52:49,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852325131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:49,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:49,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:52:49,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066111654] [2022-11-23 13:52:49,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:49,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:52:49,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:49,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:52:49,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:52:49,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-23 13:52:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:50,207 INFO L93 Difference]: Finished difference Result 253 states and 296 transitions. [2022-11-23 13:52:50,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:52:50,208 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-23 13:52:50,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:50,209 INFO L225 Difference]: With dead ends: 253 [2022-11-23 13:52:50,210 INFO L226 Difference]: Without dead ends: 253 [2022-11-23 13:52:50,210 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-23 13:52:50,211 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 60 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:50,211 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.7s Time] [2022-11-23 13:52:50,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-23 13:52:50,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 245. [2022-11-23 13:52:50,219 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-23 13:52:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 286 transitions. [2022-11-23 13:52:50,221 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 286 transitions. Word has length 12 [2022-11-23 13:52:50,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:50,222 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 286 transitions. [2022-11-23 13:52:50,222 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-23 13:52:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 286 transitions. [2022-11-23 13:52:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 13:52:50,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:50,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:50,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 13:52:50,223 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-23 13:52:50,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:50,224 INFO L85 PathProgramCache]: Analyzing trace with hash -317313492, now seen corresponding path program 1 times [2022-11-23 13:52:50,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:50,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78994670] [2022-11-23 13:52:50,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:50,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:50,293 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-23 13:52:50,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:50,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78994670] [2022-11-23 13:52:50,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78994670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:50,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:50,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:52:50,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373941813] [2022-11-23 13:52:50,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:50,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:52:50,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:50,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:52:50,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:52:50,295 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-23 13:52:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:50,549 INFO L93 Difference]: Finished difference Result 244 states and 285 transitions. [2022-11-23 13:52:50,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:52:50,550 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-23 13:52:50,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:50,552 INFO L225 Difference]: With dead ends: 244 [2022-11-23 13:52:50,552 INFO L226 Difference]: Without dead ends: 244 [2022-11-23 13:52:50,552 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-23 13:52:50,553 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-23 13:52:50,553 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-23 13:52:50,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-11-23 13:52:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-11-23 13:52:50,562 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-23 13:52:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 285 transitions. [2022-11-23 13:52:50,564 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 285 transitions. Word has length 13 [2022-11-23 13:52:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:50,564 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 285 transitions. [2022-11-23 13:52:50,564 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-23 13:52:50,565 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 285 transitions. [2022-11-23 13:52:50,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 13:52:50,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:50,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:50,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 13:52:50,566 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-23 13:52:50,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:50,566 INFO L85 PathProgramCache]: Analyzing trace with hash -317313491, now seen corresponding path program 1 times [2022-11-23 13:52:50,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:50,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091894744] [2022-11-23 13:52:50,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:50,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:50,687 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-23 13:52:50,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:50,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091894744] [2022-11-23 13:52:50,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091894744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:50,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:50,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:52:50,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860771159] [2022-11-23 13:52:50,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:50,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:52:50,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:50,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:52:50,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:52:50,689 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-23 13:52:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:50,915 INFO L93 Difference]: Finished difference Result 243 states and 284 transitions. [2022-11-23 13:52:50,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:52:50,916 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-23 13:52:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:50,917 INFO L225 Difference]: With dead ends: 243 [2022-11-23 13:52:50,918 INFO L226 Difference]: Without dead ends: 243 [2022-11-23 13:52:50,918 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-23 13:52:50,919 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 24 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-23 13:52:50,919 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-23 13:52:50,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-23 13:52:50,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2022-11-23 13:52:50,929 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-23 13:52:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 284 transitions. [2022-11-23 13:52:50,932 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 284 transitions. Word has length 13 [2022-11-23 13:52:50,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:50,933 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 284 transitions. [2022-11-23 13:52:50,934 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-23 13:52:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 284 transitions. [2022-11-23 13:52:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 13:52:50,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:50,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:50,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 13:52:50,937 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-23 13:52:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:50,938 INFO L85 PathProgramCache]: Analyzing trace with hash 4412237, now seen corresponding path program 1 times [2022-11-23 13:52:50,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:50,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456789448] [2022-11-23 13:52:50,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:50,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:51,494 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-23 13:52:51,494 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:51,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456789448] [2022-11-23 13:52:51,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456789448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:51,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:51,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 13:52:51,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684229814] [2022-11-23 13:52:51,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:51,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 13:52:51,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:51,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 13:52:51,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-23 13:52:51,498 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-23 13:52:52,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:52,219 INFO L93 Difference]: Finished difference Result 270 states and 316 transitions. [2022-11-23 13:52:52,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 13:52:52,220 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-23 13:52:52,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:52,222 INFO L225 Difference]: With dead ends: 270 [2022-11-23 13:52:52,222 INFO L226 Difference]: Without dead ends: 270 [2022-11-23 13:52:52,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-23 13:52:52,223 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 23 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-23 13:52:52,224 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-23 13:52:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-23 13:52:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 257. [2022-11-23 13:52:52,232 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-23 13:52:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2022-11-23 13:52:52,234 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 15 [2022-11-23 13:52:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:52,235 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2022-11-23 13:52:52,235 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-23 13:52:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2022-11-23 13:52:52,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 13:52:52,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:52,236 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-23 13:52:52,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 13:52:52,237 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-23 13:52:52,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2063600924, now seen corresponding path program 1 times [2022-11-23 13:52:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:52,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883973716] [2022-11-23 13:52:52,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:52,613 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-23 13:52:52,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:52,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883973716] [2022-11-23 13:52:52,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883973716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:52,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:52,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:52:52,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431891294] [2022-11-23 13:52:52,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:52,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:52:52,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:52,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:52:52,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:52:52,617 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-23 13:52:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:53,204 INFO L93 Difference]: Finished difference Result 255 states and 304 transitions. [2022-11-23 13:52:53,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:52:53,205 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-23 13:52:53,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:53,207 INFO L225 Difference]: With dead ends: 255 [2022-11-23 13:52:53,207 INFO L226 Difference]: Without dead ends: 255 [2022-11-23 13:52:53,207 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-23 13:52:53,208 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.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:53,208 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.5s Time] [2022-11-23 13:52:53,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-23 13:52:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-11-23 13:52:53,223 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-23 13:52:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 304 transitions. [2022-11-23 13:52:53,225 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 304 transitions. Word has length 23 [2022-11-23 13:52:53,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:53,225 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 304 transitions. [2022-11-23 13:52:53,225 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-23 13:52:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 304 transitions. [2022-11-23 13:52:53,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 13:52:53,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:53,227 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-23 13:52:53,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 13:52:53,227 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-23 13:52:53,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:53,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2063600923, now seen corresponding path program 1 times [2022-11-23 13:52:53,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:53,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588426225] [2022-11-23 13:52:53,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:53,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:53,483 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-23 13:52:53,484 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:53,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588426225] [2022-11-23 13:52:53,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588426225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:53,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:53,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:52:53,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908739920] [2022-11-23 13:52:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:53,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:52:53,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:53,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:52:53,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:52:53,487 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-23 13:52:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:53,928 INFO L93 Difference]: Finished difference Result 253 states and 302 transitions. [2022-11-23 13:52:53,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:52:53,929 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-23 13:52:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:53,931 INFO L225 Difference]: With dead ends: 253 [2022-11-23 13:52:53,931 INFO L226 Difference]: Without dead ends: 253 [2022-11-23 13:52:53,931 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-23 13:52:53,932 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-23 13:52:53,932 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-23 13:52:53,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-23 13:52:53,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2022-11-23 13:52:53,939 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-23 13:52:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 302 transitions. [2022-11-23 13:52:53,942 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 302 transitions. Word has length 23 [2022-11-23 13:52:53,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:53,943 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 302 transitions. [2022-11-23 13:52:53,943 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-23 13:52:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 302 transitions. [2022-11-23 13:52:53,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 13:52:53,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:53,947 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-23 13:52:53,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 13:52:53,947 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-23 13:52:53,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:53,948 INFO L85 PathProgramCache]: Analyzing trace with hash -452863182, now seen corresponding path program 1 times [2022-11-23 13:52:53,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:53,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908981047] [2022-11-23 13:52:53,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:53,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:54,054 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-23 13:52:54,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:54,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908981047] [2022-11-23 13:52:54,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908981047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:54,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:54,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:52:54,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300144803] [2022-11-23 13:52:54,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:54,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:52:54,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:54,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:52:54,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:52:54,058 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-23 13:52:54,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:54,305 INFO L93 Difference]: Finished difference Result 252 states and 301 transitions. [2022-11-23 13:52:54,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:52:54,306 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-23 13:52:54,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:54,307 INFO L225 Difference]: With dead ends: 252 [2022-11-23 13:52:54,307 INFO L226 Difference]: Without dead ends: 252 [2022-11-23 13:52:54,308 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-23 13:52:54,308 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-23 13:52:54,309 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-23 13:52:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-23 13:52:54,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2022-11-23 13:52:54,319 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-23 13:52:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 301 transitions. [2022-11-23 13:52:54,320 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 301 transitions. Word has length 24 [2022-11-23 13:52:54,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:54,322 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 301 transitions. [2022-11-23 13:52:54,322 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-23 13:52:54,322 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 301 transitions. [2022-11-23 13:52:54,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 13:52:54,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:54,323 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-23 13:52:54,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 13:52:54,324 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-23 13:52:54,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:54,324 INFO L85 PathProgramCache]: Analyzing trace with hash -452863181, now seen corresponding path program 1 times [2022-11-23 13:52:54,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:54,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759243786] [2022-11-23 13:52:54,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:54,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:54,519 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-23 13:52:54,520 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:54,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759243786] [2022-11-23 13:52:54,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759243786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:54,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:54,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:52:54,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802089182] [2022-11-23 13:52:54,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:54,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:52:54,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:54,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:52:54,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:52:54,522 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-23 13:52:54,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:54,785 INFO L93 Difference]: Finished difference Result 251 states and 300 transitions. [2022-11-23 13:52:54,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:52:54,786 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-23 13:52:54,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:54,788 INFO L225 Difference]: With dead ends: 251 [2022-11-23 13:52:54,788 INFO L226 Difference]: Without dead ends: 251 [2022-11-23 13:52:54,788 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-23 13:52:54,788 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-23 13:52:54,789 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-23 13:52:54,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-23 13:52:54,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-11-23 13:52:54,798 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-23 13:52:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 300 transitions. [2022-11-23 13:52:54,801 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 300 transitions. Word has length 24 [2022-11-23 13:52:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:54,802 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 300 transitions. [2022-11-23 13:52:54,802 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-23 13:52:54,802 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 300 transitions. [2022-11-23 13:52:54,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-23 13:52:54,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:54,807 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-23 13:52:54,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 13:52:54,809 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-23 13:52:54,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:54,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1409818669, now seen corresponding path program 1 times [2022-11-23 13:52:54,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:54,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370278609] [2022-11-23 13:52:54,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:54,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:55,321 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-23 13:52:55,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:55,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370278609] [2022-11-23 13:52:55,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370278609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:55,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:55,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 13:52:55,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965218479] [2022-11-23 13:52:55,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:55,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 13:52:55,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:55,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 13:52:55,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 13:52:55,325 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-23 13:52:55,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:55,854 INFO L93 Difference]: Finished difference Result 260 states and 310 transitions. [2022-11-23 13:52:55,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 13:52:55,855 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-23 13:52:55,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:55,856 INFO L225 Difference]: With dead ends: 260 [2022-11-23 13:52:55,856 INFO L226 Difference]: Without dead ends: 260 [2022-11-23 13:52:55,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-23 13:52:55,857 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-23 13:52:55,857 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-23 13:52:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-23 13:52:55,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2022-11-23 13:52:55,867 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-23 13:52:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 309 transitions. [2022-11-23 13:52:55,869 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 309 transitions. Word has length 26 [2022-11-23 13:52:55,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:55,869 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 309 transitions. [2022-11-23 13:52:55,869 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-23 13:52:55,870 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 309 transitions. [2022-11-23 13:52:55,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-23 13:52:55,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:55,874 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-23 13:52:55,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 13:52:55,875 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-23 13:52:55,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:55,875 INFO L85 PathProgramCache]: Analyzing trace with hash -143384194, now seen corresponding path program 1 times [2022-11-23 13:52:55,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:55,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729760531] [2022-11-23 13:52:55,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:55,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:56,742 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-23 13:52:56,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:56,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729760531] [2022-11-23 13:52:56,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729760531] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:52:56,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129698732] [2022-11-23 13:52:56,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:56,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:52:56,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:52:56,754 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:52:56,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 13:52:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:57,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-23 13:52:57,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:52:57,211 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-23 13:52:57,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 13:52:57,474 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-23 13:52:57,474 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-23 13:52:57,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:52:57,553 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-23 13:52:57,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:52:57,600 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-23 13:52:57,660 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-23 13:52:57,690 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-23 13:52:57,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:52:57,867 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-23 13:52:57,887 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-23 13:52:57,911 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-23 13:52:58,049 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:52:58,049 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-23 13:52:58,057 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-23 13:52:58,062 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-23 13:52:58,069 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-23 13:52:58,216 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:52:58,216 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-23 13:52:58,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:52:58,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:52:58,235 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-23 13:53:06,992 WARN L233 SmtUtils]: Spent 8.64s 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-23 13:53:13,187 WARN L233 SmtUtils]: Spent 5.96s 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-23 13:53:13,324 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-23 13:53:13,336 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-23 13:53:13,393 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-23 13:53:13,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129698732] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:53:13,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1521632811] [2022-11-23 13:53:13,418 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-23 13:53:13,419 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:53:13,424 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-23 13:53:13,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:53:13,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 30 [2022-11-23 13:53:13,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13080549] [2022-11-23 13:53:13,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:53:13,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-23 13:53:13,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:13,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 13:53:13,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=684, Unknown=3, NotChecked=162, Total=930 [2022-11-23 13:53:13,431 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-23 13:53:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:15,828 INFO L93 Difference]: Finished difference Result 261 states and 310 transitions. [2022-11-23 13:53:15,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 13:53:15,829 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-23 13:53:15,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:15,830 INFO L225 Difference]: With dead ends: 261 [2022-11-23 13:53:15,830 INFO L226 Difference]: Without dead ends: 261 [2022-11-23 13:53:15,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=228, Invalid=1187, Unknown=3, NotChecked=222, Total=1640 [2022-11-23 13:53:15,831 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 146 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 425 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:15,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 2355 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1439 Invalid, 0 Unknown, 425 Unchecked, 1.5s Time] [2022-11-23 13:53:15,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-23 13:53:15,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2022-11-23 13:53:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 138 states have (on average 1.818840579710145) internal successors, (251), 234 states have internal predecessors, (251), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-23 13:53:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 306 transitions. [2022-11-23 13:53:15,840 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 306 transitions. Word has length 37 [2022-11-23 13:53:15,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:15,840 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 306 transitions. [2022-11-23 13:53:15,841 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-23 13:53:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 306 transitions. [2022-11-23 13:53:15,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-23 13:53:15,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:15,842 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-23 13:53:15,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-23 13:53:16,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 13:53:16,048 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-23 13:53:16,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:16,048 INFO L85 PathProgramCache]: Analyzing trace with hash -143384193, now seen corresponding path program 1 times [2022-11-23 13:53:16,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:16,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496314525] [2022-11-23 13:53:16,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:16,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:17,199 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-23 13:53:17,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:17,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496314525] [2022-11-23 13:53:17,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496314525] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:17,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125168256] [2022-11-23 13:53:17,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:17,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:17,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:17,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:17,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 13:53:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:17,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-23 13:53:17,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:17,545 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-23 13:53:17,557 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-23 13:53:17,738 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-23 13:53:17,747 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-23 13:53:18,028 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 13:53:18,029 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-23 13:53:18,038 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-23 13:53:18,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:53:18,113 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-23 13:53:18,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:53:18,127 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-23 13:53:18,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:53:18,152 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-23 13:53:18,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:53:18,162 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-23 13:53:18,222 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-23 13:53:18,227 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-23 13:53:18,284 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-23 13:53:18,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:53:18,427 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-23 13:53:22,294 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:53:22,295 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-23 13:53:22,303 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-23 13:53:22,309 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-23 13:53:22,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:53:22,322 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-23 13:53:22,331 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-23 13:53:22,350 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-23 13:53:22,358 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-23 13:53:22,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:53:22,376 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-23 13:53:22,386 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-23 13:53:23,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:53:23,848 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-23 13:53:23,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:53:23,858 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-23 13:53:23,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:53:23,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:53:23,878 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-23 13:53:23,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:53:23,897 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:53:23,897 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-23 13:53:23,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:53:23,959 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-23 13:53:23,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:53:23,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:53:23,973 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-23 13:53:34,217 WARN L233 SmtUtils]: Spent 10.10s 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-23 13:53:34,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:53:34,580 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-23 13:53:34,672 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-23 13:53:34,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125168256] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:53:34,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1966629315] [2022-11-23 13:53:34,675 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-23 13:53:34,676 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:53:34,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-23 13:53:34,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:53:34,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2022-11-23 13:53:34,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068971958] [2022-11-23 13:53:34,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:53:34,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 13:53:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:34,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 13:53:34,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=4, NotChecked=60, Total=1056 [2022-11-23 13:53:34,680 INFO L87 Difference]: Start difference. First operand 258 states and 306 transitions. Second operand has 33 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 13:53:39,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:39,820 INFO L93 Difference]: Finished difference Result 257 states and 305 transitions. [2022-11-23 13:53:39,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 13:53:39,820 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-23 13:53:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:39,822 INFO L225 Difference]: With dead ends: 257 [2022-11-23 13:53:39,822 INFO L226 Difference]: Without dead ends: 257 [2022-11-23 13:53:39,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=309, Invalid=1583, Unknown=4, NotChecked=84, Total=1980 [2022-11-23 13:53:39,824 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 119 mSDsluCounter, 2680 mSDsCounter, 0 mSdLazyCounter, 2654 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 2880 SdHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:39,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 2880 Invalid, 2842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2654 Invalid, 0 Unknown, 129 Unchecked, 3.4s Time] [2022-11-23 13:53:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-11-23 13:53:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2022-11-23 13:53:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 138 states have (on average 1.8115942028985508) internal successors, (250), 233 states have internal predecessors, (250), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-23 13:53:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 305 transitions. [2022-11-23 13:53:39,833 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 305 transitions. Word has length 37 [2022-11-23 13:53:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:39,834 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 305 transitions. [2022-11-23 13:53:39,834 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-23 13:53:39,834 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 305 transitions. [2022-11-23 13:53:39,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-23 13:53:39,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:39,835 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-23 13:53:39,848 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-23 13:53:40,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 13:53:40,043 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-23 13:53:40,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:40,043 INFO L85 PathProgramCache]: Analyzing trace with hash -835158194, now seen corresponding path program 1 times [2022-11-23 13:53:40,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:40,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417539752] [2022-11-23 13:53:40,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:40,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:40,231 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-23 13:53:40,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:40,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417539752] [2022-11-23 13:53:40,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417539752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:40,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:40,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:53:40,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861139393] [2022-11-23 13:53:40,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:40,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:53:40,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:40,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:53:40,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:53:40,234 INFO L87 Difference]: Start difference. First operand 257 states and 305 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 13:53:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:40,410 INFO L93 Difference]: Finished difference Result 246 states and 282 transitions. [2022-11-23 13:53:40,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:53:40,411 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-23 13:53:40,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:40,412 INFO L225 Difference]: With dead ends: 246 [2022-11-23 13:53:40,412 INFO L226 Difference]: Without dead ends: 246 [2022-11-23 13:53:40,412 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-23 13:53:40,413 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 19 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:40,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 802 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:53:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-23 13:53:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-11-23 13:53:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 130 states have (on average 1.823076923076923) internal successors, (237), 225 states have internal predecessors, (237), 29 states have call successors, (29), 11 states have call predecessors, (29), 9 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2022-11-23 13:53:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 282 transitions. [2022-11-23 13:53:40,425 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 282 transitions. Word has length 40 [2022-11-23 13:53:40,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:40,426 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 282 transitions. [2022-11-23 13:53:40,426 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-23 13:53:40,426 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 282 transitions. [2022-11-23 13:53:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-23 13:53:40,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:40,429 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-23 13:53:40,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 13:53:40,430 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-23 13:53:40,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:40,430 INFO L85 PathProgramCache]: Analyzing trace with hash 54211896, now seen corresponding path program 1 times [2022-11-23 13:53:40,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:40,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539109105] [2022-11-23 13:53:40,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:40,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:41,627 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-23 13:53:41,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:41,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539109105] [2022-11-23 13:53:41,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539109105] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:41,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724508732] [2022-11-23 13:53:41,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:41,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:41,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:41,631 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:41,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 13:53:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:41,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-23 13:53:41,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:41,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 13:53:42,211 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-23 13:53:42,310 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-11-23 13:53:42,311 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-23 13:53:52,909 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-23 13:53:52,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:53:53,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724508732] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:53,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [123978596] [2022-11-23 13:53:53,798 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-11-23 13:53:53,799 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:53:53,799 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-23 13:53:53,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 13:53:53,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2022-11-23 13:53:53,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548525817] [2022-11-23 13:53:53,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 13:53:53,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-23 13:53:53,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:53,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-23 13:53:53,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=831, Unknown=12, NotChecked=0, Total=930 [2022-11-23 13:53:53,804 INFO L87 Difference]: Start difference. First operand 246 states and 282 transitions. Second operand has 30 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 13:53:56,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:54:00,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:54:09,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:54:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:54:12,669 INFO L93 Difference]: Finished difference Result 249 states and 284 transitions. [2022-11-23 13:54:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 13:54:12,670 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-23 13:54:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:54:12,671 INFO L225 Difference]: With dead ends: 249 [2022-11-23 13:54:12,672 INFO L226 Difference]: Without dead ends: 246 [2022-11-23 13:54:12,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=229, Invalid=1559, Unknown=18, NotChecked=0, Total=1806 [2022-11-23 13:54:12,673 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 179 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 2754 mSolverCounterSat, 64 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 2827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2754 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:54:12,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 2123 Invalid, 2827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2754 Invalid, 9 Unknown, 0 Unchecked, 9.4s Time] [2022-11-23 13:54:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-23 13:54:12,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-11-23 13:54:12,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 130 states have (on average 1.8153846153846154) internal successors, (236), 225 states have internal predecessors, (236), 29 states have call successors, (29), 11 states have call predecessors, (29), 9 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2022-11-23 13:54:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 281 transitions. [2022-11-23 13:54:12,682 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 281 transitions. Word has length 46 [2022-11-23 13:54:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:12,683 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 281 transitions. [2022-11-23 13:54:12,683 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-23 13:54:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 281 transitions. [2022-11-23 13:54:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-23 13:54:12,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:12,684 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-23 13:54:12,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 13:54:12,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:54:12,891 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-23 13:54:12,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:12,891 INFO L85 PathProgramCache]: Analyzing trace with hash -750347739, now seen corresponding path program 1 times [2022-11-23 13:54:12,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:12,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581106265] [2022-11-23 13:54:12,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:12,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:15,739 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-23 13:54:15,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:15,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581106265] [2022-11-23 13:54:15,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581106265] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:54:15,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702916000] [2022-11-23 13:54:15,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:15,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:54:15,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:54:15,743 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:54:15,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 13:54:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:16,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-23 13:54:16,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:54:16,018 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-23 13:54:16,157 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-23 13:54:16,170 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-23 13:54:16,362 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-23 13:54:16,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:54:16,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 13:54:16,385 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-23 13:54:16,429 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-23 13:54:16,484 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-23 13:54:16,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:54:16,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:54:16,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:54:16,585 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-23 13:54:16,585 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-23 13:54:16,599 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-23 13:54:16,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:54:16,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702916000] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:54:16,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1530762186] [2022-11-23 13:54:16,887 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-11-23 13:54:16,887 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:54:16,887 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-23 13:54:16,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 13:54:16,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11] total 30 [2022-11-23 13:54:16,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128363525] [2022-11-23 13:54:16,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 13:54:16,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-23 13:54:16,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:16,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 13:54:16,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=628, Unknown=5, NotChecked=270, Total=992 [2022-11-23 13:54:16,890 INFO L87 Difference]: Start difference. First operand 246 states and 281 transitions. Second operand has 31 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 28 states have internal predecessors, (66), 8 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-23 13:54:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:54:47,000 INFO L93 Difference]: Finished difference Result 270 states and 316 transitions. [2022-11-23 13:54:47,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 13:54:47,003 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-23 13:54:47,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:54:47,005 INFO L225 Difference]: With dead ends: 270 [2022-11-23 13:54:47,005 INFO L226 Difference]: Without dead ends: 270 [2022-11-23 13:54:47,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=218, Invalid=1591, Unknown=17, NotChecked=430, Total=2256 [2022-11-23 13:54:47,008 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 283 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 3834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1293 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:54:47,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1031 Invalid, 3834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2443 Invalid, 0 Unknown, 1293 Unchecked, 3.8s Time] [2022-11-23 13:54:47,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-23 13:54:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 254. [2022-11-23 13:54:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 136 states have (on average 1.8014705882352942) internal successors, (245), 229 states have internal predecessors, (245), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-23 13:54:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 293 transitions. [2022-11-23 13:54:47,018 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 293 transitions. Word has length 47 [2022-11-23 13:54:47,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:47,018 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 293 transitions. [2022-11-23 13:54:47,019 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-23 13:54:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 293 transitions. [2022-11-23 13:54:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-23 13:54:47,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:47,020 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-23 13:54:47,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 13:54:47,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:54:47,227 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-23 13:54:47,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:47,227 INFO L85 PathProgramCache]: Analyzing trace with hash -750347738, now seen corresponding path program 1 times [2022-11-23 13:54:47,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:47,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671889073] [2022-11-23 13:54:47,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:47,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:48,786 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-23 13:54:48,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:48,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671889073] [2022-11-23 13:54:48,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671889073] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:54:48,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714993131] [2022-11-23 13:54:48,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:48,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:54:48,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:54:48,788 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:54:48,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 13:54:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:49,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-23 13:54:49,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:54:49,075 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-23 13:54:49,256 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-23 13:54:49,261 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-23 13:54:49,290 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-23 13:54:49,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:54:49,681 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-23 13:54:49,854 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-23 13:54:49,984 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-23 13:54:50,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:54:50,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:54:50,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:54:50,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:54:50,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:54:50,088 INFO L321 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-11-23 13:54:50,088 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-23 13:54:50,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:54:50,135 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-23 13:54:50,135 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-23 13:54:50,200 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-23 13:54:50,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:54:57,173 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:54:57,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714993131] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:54:57,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1692810829] [2022-11-23 13:54:57,177 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-11-23 13:54:57,177 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:54:57,177 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-23 13:54:57,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 13:54:57,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2022-11-23 13:54:57,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265973528] [2022-11-23 13:54:57,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 13:54:57,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 13:54:57,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:57,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 13:54:57,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=509, Unknown=3, NotChecked=144, Total=756 [2022-11-23 13:54:57,179 INFO L87 Difference]: Start difference. First operand 254 states and 293 transitions. Second operand has 26 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 8 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-23 13:55:14,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:55:14,509 INFO L93 Difference]: Finished difference Result 261 states and 302 transitions. [2022-11-23 13:55:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 13:55:14,538 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-23 13:55:14,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:55:14,540 INFO L225 Difference]: With dead ends: 261 [2022-11-23 13:55:14,540 INFO L226 Difference]: Without dead ends: 261 [2022-11-23 13:55:14,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=173, Invalid=892, Unknown=3, NotChecked=192, Total=1260 [2022-11-23 13:55:14,541 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 217 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 3113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 742 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:55:14,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 906 Invalid, 3113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2309 Invalid, 0 Unknown, 742 Unchecked, 3.1s Time] [2022-11-23 13:55:14,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-23 13:55:14,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 254. [2022-11-23 13:55:14,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 136 states have (on average 1.786764705882353) internal successors, (243), 229 states have internal predecessors, (243), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-23 13:55:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 291 transitions. [2022-11-23 13:55:14,550 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 291 transitions. Word has length 47 [2022-11-23 13:55:14,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:55:14,550 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 291 transitions. [2022-11-23 13:55:14,551 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-23 13:55:14,551 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 291 transitions. [2022-11-23 13:55:14,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-23 13:55:14,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:55:14,552 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-23 13:55:14,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 13:55:14,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-23 13:55:14,759 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-23 13:55:14,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:55:14,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1785924258, now seen corresponding path program 1 times [2022-11-23 13:55:14,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:55:14,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184035406] [2022-11-23 13:55:14,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:55:14,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:55:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:55:18,067 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-23 13:55:18,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:55:18,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184035406] [2022-11-23 13:55:18,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184035406] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:55:18,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255828005] [2022-11-23 13:55:18,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:55:18,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:55:18,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:55:18,069 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:55:18,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 13:55:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:55:18,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 105 conjunts are in the unsatisfiable core [2022-11-23 13:55:18,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:55:18,397 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-23 13:55:18,853 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-23 13:55:18,863 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-23 13:55:19,557 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-23 13:55:20,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 99 [2022-11-23 13:55:20,241 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-23 13:55:20,248 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-23 13:55:20,252 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-23 13:55:20,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:55:20,896 INFO L321 Elim1Store]: treesize reduction 99, result has 23.8 percent of original size [2022-11-23 13:55:20,897 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-23 13:55:20,929 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-23 13:55:20,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:55:21,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:55:21,939 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-23 13:55:21,947 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-23 13:55:22,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255828005] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:55:22,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2074052211] [2022-11-23 13:55:22,089 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-23 13:55:22,089 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:55:22,090 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-23 13:55:22,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 13:55:22,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 42 [2022-11-23 13:55:22,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802556149] [2022-11-23 13:55:22,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 13:55:22,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-23 13:55:22,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:55:22,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-23 13:55:22,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1739, Unknown=3, NotChecked=0, Total=1892 [2022-11-23 13:55:22,094 INFO L87 Difference]: Start difference. First operand 254 states and 291 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-23 13:55:36,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:55:36,407 INFO L93 Difference]: Finished difference Result 264 states and 305 transitions. [2022-11-23 13:55:36,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-23 13:55:36,411 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-23 13:55:36,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:55:36,412 INFO L225 Difference]: With dead ends: 264 [2022-11-23 13:55:36,413 INFO L226 Difference]: Without dead ends: 264 [2022-11-23 13:55:36,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1123 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=420, Invalid=4131, Unknown=5, NotChecked=0, Total=4556 [2022-11-23 13:55:36,417 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 231 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 4316 mSolverCounterSat, 67 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 4391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 4316 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:55:36,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 2198 Invalid, 4391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 4316 Invalid, 8 Unknown, 0 Unchecked, 7.8s Time] [2022-11-23 13:55:36,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-11-23 13:55:36,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 256. [2022-11-23 13:55:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 138 states have (on average 1.789855072463768) internal successors, (247), 231 states have internal predecessors, (247), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-23 13:55:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 295 transitions. [2022-11-23 13:55:36,435 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 295 transitions. Word has length 48 [2022-11-23 13:55:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:55:36,435 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 295 transitions. [2022-11-23 13:55:36,436 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-23 13:55:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 295 transitions. [2022-11-23 13:55:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-23 13:55:36,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:55:36,437 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-23 13:55:36,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 13:55:36,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:55:36,645 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-23 13:55:36,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:55:36,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1785924257, now seen corresponding path program 1 times [2022-11-23 13:55:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:55:36,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674783459] [2022-11-23 13:55:36,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:55:36,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:55:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:55:40,106 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-23 13:55:40,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:55:40,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674783459] [2022-11-23 13:55:40,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674783459] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:55:40,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586321332] [2022-11-23 13:55:40,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:55:40,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:55:40,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:55:40,111 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:55:40,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 13:55:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:55:40,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-23 13:55:40,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:55:40,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-23 13:55:40,799 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-23 13:55:40,902 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-23 13:55:47,086 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-23 13:55:57,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:55:57,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:55:57,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:55:57,434 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-23 13:55:57,435 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-23 13:55:57,454 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 13:55:57,455 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-23 13:55:57,546 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-23 13:55:57,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:55:59,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586321332] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:55:59,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2028091051] [2022-11-23 13:55:59,974 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-23 13:55:59,975 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:55:59,975 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-23 13:55:59,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 13:55:59,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15] total 39 [2022-11-23 13:55:59,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603629019] [2022-11-23 13:55:59,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 13:55:59,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-23 13:55:59,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:55:59,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-23 13:55:59,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1336, Unknown=10, NotChecked=150, Total=1640 [2022-11-23 13:55:59,978 INFO L87 Difference]: Start difference. First operand 256 states and 295 transitions. Second operand has 40 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 32 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-23 13:56:02,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:56:04,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:56:10,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:56:20,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:56:22,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:56:24,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:56:26,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:57:04,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:57:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:05,194 INFO L93 Difference]: Finished difference Result 261 states and 301 transitions. [2022-11-23 13:57:05,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-23 13:57:05,194 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-23 13:57:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:05,196 INFO L225 Difference]: With dead ends: 261 [2022-11-23 13:57:05,196 INFO L226 Difference]: Without dead ends: 261 [2022-11-23 13:57:05,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 64.3s TimeCoverageRelationStatistics Valid=418, Invalid=3351, Unknown=21, NotChecked=242, Total=4032 [2022-11-23 13:57:05,198 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 347 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 3291 mSolverCounterSat, 119 mSolverCounterUnsat, 55 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 3963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 3291 IncrementalHoareTripleChecker+Invalid, 55 IncrementalHoareTripleChecker+Unknown, 498 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:05,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1596 Invalid, 3963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 3291 Invalid, 55 Unknown, 498 Unchecked, 20.9s Time] [2022-11-23 13:57:05,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-23 13:57:05,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 260. [2022-11-23 13:57:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 140 states have (on average 1.7642857142857142) internal successors, (247), 234 states have internal predecessors, (247), 30 states have call successors, (30), 11 states have call predecessors, (30), 12 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-23 13:57:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 299 transitions. [2022-11-23 13:57:05,205 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 299 transitions. Word has length 48 [2022-11-23 13:57:05,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:05,205 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 299 transitions. [2022-11-23 13:57:05,206 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-23 13:57:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 299 transitions. [2022-11-23 13:57:05,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-23 13:57:05,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:05,207 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-23 13:57:05,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:05,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:05,415 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting dll_insert_masterErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 13:57:05,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:05,415 INFO L85 PathProgramCache]: Analyzing trace with hash -410953665, now seen corresponding path program 1 times [2022-11-23 13:57:05,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:05,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634766286] [2022-11-23 13:57:05,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:05,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:05,849 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-23 13:57:05,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:05,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634766286] [2022-11-23 13:57:05,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634766286] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:05,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858539474] [2022-11-23 13:57:05,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:05,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:05,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:05,851 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:05,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 13:57:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:06,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-23 13:57:06,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:06,268 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 13:57:06,268 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-23 13:57:06,277 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-23 13:57:06,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:06,552 INFO L321 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-11-23 13:57:06,553 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-23 13:57:06,598 INFO L321 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-11-23 13:57:06,599 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-23 13:57:06,654 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-23 13:57:06,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858539474] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:06,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2145104851] [2022-11-23 13:57:06,657 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-23 13:57:06,661 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:06,662 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-23 13:57:06,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:06,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-11-23 13:57:06,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138623499] [2022-11-23 13:57:06,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:06,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:57:06,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:06,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:57:06,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:57:06,666 INFO L87 Difference]: Start difference. First operand 260 states and 299 transitions. Second operand has 14 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-23 13:57:07,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:07,403 INFO L93 Difference]: Finished difference Result 258 states and 297 transitions. [2022-11-23 13:57:07,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 13:57:07,404 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-23 13:57:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:07,405 INFO L225 Difference]: With dead ends: 258 [2022-11-23 13:57:07,405 INFO L226 Difference]: Without dead ends: 258 [2022-11-23 13:57:07,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:57:07,406 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 99 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:07,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1279 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 13:57:07,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-23 13:57:07,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-11-23 13:57:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 140 states have (on average 1.75) internal successors, (245), 232 states have internal predecessors, (245), 30 states have call successors, (30), 11 states have call predecessors, (30), 12 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-23 13:57:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 297 transitions. [2022-11-23 13:57:07,416 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 297 transitions. Word has length 60 [2022-11-23 13:57:07,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:07,416 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 297 transitions. [2022-11-23 13:57:07,416 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-23 13:57:07,417 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 297 transitions. [2022-11-23 13:57:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-23 13:57:07,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:07,417 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-23 13:57:07,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:07,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-23 13:57:07,625 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting dll_insert_masterErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 13:57:07,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:07,625 INFO L85 PathProgramCache]: Analyzing trace with hash -410953664, now seen corresponding path program 1 times [2022-11-23 13:57:07,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:07,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606301312] [2022-11-23 13:57:07,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:07,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:08,388 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-23 13:57:08,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:08,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606301312] [2022-11-23 13:57:08,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606301312] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:08,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492712850] [2022-11-23 13:57:08,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:08,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:08,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:08,390 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:08,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 13:57:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:08,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-23 13:57:08,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:08,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:57:08,876 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-23 13:57:08,883 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 13:57:08,883 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-23 13:57:08,899 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-23 13:57:08,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:09,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2022-11-23 13:57:09,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:57:09,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 62 [2022-11-23 13:57:09,669 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 13:57:09,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-23 13:57:09,684 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 13:57:09,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-23 13:57:09,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:57:09,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2022-11-23 13:57:09,774 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 13:57:09,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-23 13:57:09,868 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-23 13:57:09,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492712850] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:57:09,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1501896485] [2022-11-23 13:57:09,872 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-23 13:57:09,872 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:09,872 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-23 13:57:09,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:57:09,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 23 [2022-11-23 13:57:09,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280383157] [2022-11-23 13:57:09,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:09,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 13:57:09,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:09,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 13:57:09,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2022-11-23 13:57:09,875 INFO L87 Difference]: Start difference. First operand 258 states and 297 transitions. Second operand has 24 states, 17 states have (on average 3.411764705882353) internal successors, (58), 18 states have internal predecessors, (58), 10 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-23 13:57:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:11,120 INFO L93 Difference]: Finished difference Result 256 states and 295 transitions. [2022-11-23 13:57:11,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 13:57:11,120 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 17 states have (on average 3.411764705882353) internal successors, (58), 18 states have internal predecessors, (58), 10 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 60 [2022-11-23 13:57:11,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:11,122 INFO L225 Difference]: With dead ends: 256 [2022-11-23 13:57:11,122 INFO L226 Difference]: Without dead ends: 256 [2022-11-23 13:57:11,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2022-11-23 13:57:11,123 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 127 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:11,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1659 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-23 13:57:11,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-23 13:57:11,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-11-23 13:57:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 140 states have (on average 1.7357142857142858) internal successors, (243), 230 states have internal predecessors, (243), 30 states have call successors, (30), 11 states have call predecessors, (30), 12 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-23 13:57:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 295 transitions. [2022-11-23 13:57:11,131 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 295 transitions. Word has length 60 [2022-11-23 13:57:11,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:11,131 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 295 transitions. [2022-11-23 13:57:11,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 17 states have (on average 3.411764705882353) internal successors, (58), 18 states have internal predecessors, (58), 10 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-23 13:57:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 295 transitions. [2022-11-23 13:57:11,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-23 13:57:11,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:11,133 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-23 13:57:11,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:11,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:11,339 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 13:57:11,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:11,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1299602016, now seen corresponding path program 1 times [2022-11-23 13:57:11,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:11,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771568792] [2022-11-23 13:57:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:11,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 13:57:15,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:15,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771568792] [2022-11-23 13:57:15,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771568792] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:15,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787468370] [2022-11-23 13:57:15,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:15,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:15,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:15,645 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:15,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 13:57:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:15,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-23 13:57:15,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:15,988 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-23 13:57:16,079 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-23 13:57:16,329 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 13:57:16,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-11-23 13:57:16,490 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-23 13:57:16,496 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2617 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_2617))) is different from true [2022-11-23 13:57:16,656 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 13:57:16,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-11-23 13:57:16,935 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2622 (Array Int Int))) (= (select (select (store |c_old(#memory_$Pointer$.base)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_2622) |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|)) (< |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2620 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_2620)))) is different from true [2022-11-23 13:57:17,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:57:17,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-11-23 13:57:17,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:57:17,761 INFO L321 Elim1Store]: treesize reduction 146, result has 23.2 percent of original size [2022-11-23 13:57:17,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 88 [2022-11-23 13:57:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-23 13:57:17,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:18,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:57:18,397 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-23 13:57:18,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:57:18,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2022-11-23 13:57:18,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787468370] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:18,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1494199450] [2022-11-23 13:57:18,518 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-23 13:57:18,518 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:18,519 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-23 13:57:18,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 13:57:18,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 22] total 45 [2022-11-23 13:57:18,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883204612] [2022-11-23 13:57:18,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:18,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-23 13:57:18,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:18,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-23 13:57:18,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1809, Unknown=4, NotChecked=174, Total=2162 [2022-11-23 13:57:18,522 INFO L87 Difference]: Start difference. First operand 256 states and 295 transitions. Second operand has 46 states, 41 states have (on average 1.975609756097561) internal successors, (81), 43 states have internal predecessors, (81), 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-23 13:57:21,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:57:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:37,965 INFO L93 Difference]: Finished difference Result 281 states and 333 transitions. [2022-11-23 13:57:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 13:57:37,966 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 1.975609756097561) internal successors, (81), 43 states have internal predecessors, (81), 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-23 13:57:37,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:37,968 INFO L225 Difference]: With dead ends: 281 [2022-11-23 13:57:37,968 INFO L226 Difference]: Without dead ends: 281 [2022-11-23 13:57:37,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=375, Invalid=3408, Unknown=7, NotChecked=242, Total=4032 [2022-11-23 13:57:37,969 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 173 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 4181 mSolverCounterSat, 56 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 4769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 4181 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:37,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1956 Invalid, 4769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 4181 Invalid, 25 Unknown, 507 Unchecked, 9.3s Time] [2022-11-23 13:57:37,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-23 13:57:37,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 265. [2022-11-23 13:57:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 146 states have (on average 1.726027397260274) internal successors, (252), 235 states have internal predecessors, (252), 31 states have call successors, (31), 11 states have call predecessors, (31), 14 states have return successors, (27), 21 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-23 13:57:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 310 transitions. [2022-11-23 13:57:37,978 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 310 transitions. Word has length 61 [2022-11-23 13:57:37,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:37,978 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 310 transitions. [2022-11-23 13:57:37,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 1.975609756097561) internal successors, (81), 43 states have internal predecessors, (81), 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-23 13:57:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 310 transitions. [2022-11-23 13:57:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-23 13:57:37,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:37,980 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-23 13:57:37,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:38,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-23 13:57:38,187 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting dll_insert_masterErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 13:57:38,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1299602015, now seen corresponding path program 1 times [2022-11-23 13:57:38,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:38,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472537119] [2022-11-23 13:57:38,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:38,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 13:57:41,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:41,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472537119] [2022-11-23 13:57:41,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472537119] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:41,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369648219] [2022-11-23 13:57:41,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:41,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:41,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:41,969 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:41,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 13:57:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:42,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-23 13:57:42,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:42,327 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-23 13:57:42,579 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-23 13:57:42,891 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 13:57:42,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-11-23 13:57:43,163 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-23 13:57:43,486 INFO L321 Elim1Store]: treesize reduction 26, result has 21.2 percent of original size [2022-11-23 13:57:43,486 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 96 treesize of output 92 [2022-11-23 13:57:43,493 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 54 treesize of output 34 [2022-11-23 13:57:43,956 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 53 treesize of output 41 [2022-11-23 13:57:44,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:57:44,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:57:44,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:57:44,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:57:44,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:57:44,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:57:44,532 INFO L321 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2022-11-23 13:57:44,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 45 [2022-11-23 13:57:44,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:57:44,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:57:44,608 INFO L321 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-11-23 13:57:44,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 111 [2022-11-23 13:57:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 19 refuted. 8 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 13:57:44,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:54,015 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:57:54,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369648219] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:54,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1822225325] [2022-11-23 13:57:54,017 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-23 13:57:54,018 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:57:54,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-23 13:57:54,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 13:57:54,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 43 [2022-11-23 13:57:54,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475295116] [2022-11-23 13:57:54,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 13:57:54,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-23 13:57:54,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:54,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-23 13:57:54,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1854, Unknown=6, NotChecked=0, Total=2070 [2022-11-23 13:57:54,020 INFO L87 Difference]: Start difference. First operand 265 states and 310 transitions. Second operand has 44 states, 39 states have (on average 2.282051282051282) internal successors, (89), 39 states have internal predecessors, (89), 10 states have call successors, (12), 3 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-23 13:58:04,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:58:04,348 INFO L93 Difference]: Finished difference Result 280 states and 327 transitions. [2022-11-23 13:58:04,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-23 13:58:04,349 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 39 states have (on average 2.282051282051282) internal successors, (89), 39 states have internal predecessors, (89), 10 states have call successors, (12), 3 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 61 [2022-11-23 13:58:04,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:58:04,350 INFO L225 Difference]: With dead ends: 280 [2022-11-23 13:58:04,350 INFO L226 Difference]: Without dead ends: 280 [2022-11-23 13:58:04,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=494, Invalid=3771, Unknown=25, NotChecked=0, Total=4290 [2022-11-23 13:58:04,352 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 318 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 3534 mSolverCounterSat, 101 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 3662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 3534 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:58:04,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1381 Invalid, 3662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 3534 Invalid, 27 Unknown, 0 Unchecked, 5.6s Time] [2022-11-23 13:58:04,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-23 13:58:04,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 265. [2022-11-23 13:58:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 146 states have (on average 1.7123287671232876) internal successors, (250), 235 states have internal predecessors, (250), 31 states have call successors, (31), 11 states have call predecessors, (31), 14 states have return successors, (27), 21 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-23 13:58:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 308 transitions. [2022-11-23 13:58:04,361 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 308 transitions. Word has length 61 [2022-11-23 13:58:04,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:58:04,361 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 308 transitions. [2022-11-23 13:58:04,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 39 states have (on average 2.282051282051282) internal successors, (89), 39 states have internal predecessors, (89), 10 states have call successors, (12), 3 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-23 13:58:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 308 transitions. [2022-11-23 13:58:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-23 13:58:04,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:58:04,363 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-23 13:58:04,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 13:58:04,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-23 13:58:04,579 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 13:58:04,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:58:04,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2044777986, now seen corresponding path program 1 times [2022-11-23 13:58:04,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:58:04,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651479614] [2022-11-23 13:58:04,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:58:04,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:58:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:58:05,422 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-23 13:58:05,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:58:05,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651479614] [2022-11-23 13:58:05,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651479614] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:58:05,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302348999] [2022-11-23 13:58:05,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:58:05,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:58:05,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:58:05,424 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:58:05,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 13:58:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:58:05,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-23 13:58:05,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:58:06,028 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-23 13:58:06,375 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-23 13:58:06,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 13:58:06,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:58:06,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 13:58:06,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:58:06,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 13:58:06,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:58:06,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 13:58:06,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:58:06,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 13:58:06,618 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-23 13:58:06,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:58:06,715 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| Int) (v_ArrVal_3239 (Array Int Int))) (or (not (< |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| |c_#StackHeapBarrier|)) (= 1 (select (store |c_#valid| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| 1) (select (select (store |c_#memory_$Pointer$.base| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| v_ArrVal_3239) |c_dll_insert_master_#in~dll#1.base|) |c_dll_insert_master_#in~dll#1.offset|))))) is different from false [2022-11-23 13:58:06,726 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| Int) (v_ArrVal_3239 (Array Int Int))) (or (not (< |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| 1) (select (select (store |c_#memory_$Pointer$.base| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| v_ArrVal_3239) |c_##fun~$Pointer$~TO~VOID_#~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#~10#1.offset|)) 1))) is different from false [2022-11-23 13:58:06,747 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| Int) (v_ArrVal_3239 (Array Int Int))) (or (not (< |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| 1) (select (select (store |c_#memory_$Pointer$.base| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| v_ArrVal_3239) |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-23 13:58:06,762 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| Int) (v_ArrVal_3239 (Array Int Int))) (or (= (select (store |c_#valid| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| 1) (select (select (store |c_#memory_$Pointer$.base| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| v_ArrVal_3239) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|)) 1) (not (< |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| |c_#StackHeapBarrier|)))) is different from false [2022-11-23 13:58:06,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:58:06,939 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-23 13:58:06,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:58:06,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2022-11-23 13:58:06,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:58:06,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 70 [2022-11-23 13:58:06,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-11-23 13:58:07,426 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:58:07,427 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-23 13:58:07,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:58:07,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 120 [2022-11-23 13:58:07,524 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:58:07,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 122 treesize of output 204 [2022-11-23 13:58:07,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 112 [2022-11-23 13:58:07,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 108 [2022-11-23 13:58:16,677 WARN L233 SmtUtils]: Spent 7.88s on a formula simplification. DAG size of input: 55 DAG size of output: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:58:16,705 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:58:16,705 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-23 13:58:16,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:58:16,717 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:58:16,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 21 treesize of output 24 [2022-11-23 13:58:16,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:58:16,733 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-23 13:58:16,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:58:16,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2022-11-23 13:58:16,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-11-23 13:58:16,795 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:58:16,795 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-23 13:58:16,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:58:16,809 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:58:16,809 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-23 13:58:56,943 WARN L233 SmtUtils]: Spent 39.94s on a formula simplification. DAG size of input: 57 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:58:57,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:58:57,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 134 treesize of output 202 [2022-11-23 13:59:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2022-11-23 13:59:01,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302348999] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:59:01,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2124902458] [2022-11-23 13:59:01,132 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-11-23 13:59:01,133 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:59:01,133 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-23 13:59:01,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:59:01,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 37 [2022-11-23 13:59:01,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633781656] [2022-11-23 13:59:01,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:59:01,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-23 13:59:01,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:59:01,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-23 13:59:01,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1010, Unknown=19, NotChecked=268, Total=1406 [2022-11-23 13:59:01,136 INFO L87 Difference]: Start difference. First operand 265 states and 308 transitions. Second operand has 38 states, 30 states have (on average 2.6) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-23 13:59:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:59:04,203 INFO L93 Difference]: Finished difference Result 266 states and 308 transitions. [2022-11-23 13:59:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 13:59:04,204 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 30 states have (on average 2.6) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) Word has length 63 [2022-11-23 13:59:04,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:59:04,205 INFO L225 Difference]: With dead ends: 266 [2022-11-23 13:59:04,205 INFO L226 Difference]: Without dead ends: 266 [2022-11-23 13:59:04,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 104 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 53.5s TimeCoverageRelationStatistics Valid=254, Invalid=1723, Unknown=19, NotChecked=356, Total=2352 [2022-11-23 13:59:04,207 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 111 mSDsluCounter, 3531 mSDsCounter, 0 mSdLazyCounter, 2189 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 3732 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 573 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:59:04,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 3732 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2189 Invalid, 0 Unknown, 573 Unchecked, 2.2s Time] [2022-11-23 13:59:04,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-23 13:59:04,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-11-23 13:59:04,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 235 states have internal predecessors, (250), 31 states have call successors, (31), 11 states have call predecessors, (31), 15 states have return successors, (27), 22 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-23 13:59:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 308 transitions. [2022-11-23 13:59:04,231 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 308 transitions. Word has length 63 [2022-11-23 13:59:04,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:59:04,232 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 308 transitions. [2022-11-23 13:59:04,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 30 states have (on average 2.6) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-23 13:59:04,232 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 308 transitions. [2022-11-23 13:59:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-23 13:59:04,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:59:04,233 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-23 13:59:04,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 13:59:04,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-23 13:59:04,433 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting dll_insert_masterErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 13:59:04,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:59:04,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2044777985, now seen corresponding path program 1 times [2022-11-23 13:59:04,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:59:04,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181518519] [2022-11-23 13:59:04,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:59:04,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:59:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:59:05,547 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-23 13:59:05,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:59:05,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181518519] [2022-11-23 13:59:05,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181518519] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:59:05,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397951857] [2022-11-23 13:59:05,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:59:05,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:59:05,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:59:05,548 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:59:05,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 13:59:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:59:05,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-23 13:59:05,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:59:06,030 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-23 13:59:06,037 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-23 13:59:06,313 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 13:59:06,313 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-23 13:59:06,320 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-23 13:59:06,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:59:06,374 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-23 13:59:06,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:59:06,385 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-23 13:59:06,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:59:06,400 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-23 13:59:06,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:59:06,409 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-23 13:59:06,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:59:06,425 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-23 13:59:06,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:59:06,448 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-23 13:59:06,488 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-23 13:59:06,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 15 treesize of output 7 [2022-11-23 13:59:06,501 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-23 13:59:06,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:59:08,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:59:08,402 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-23 13:59:08,408 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-23 13:59:08,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:59:08,416 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-23 13:59:08,421 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-23 13:59:08,436 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:59:08,437 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-23 13:59:08,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 143 [2022-11-23 13:59:08,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 144 [2022-11-23 13:59:08,472 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:59:08,473 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-23 13:59:08,484 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-23 13:59:09,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:59:09,892 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-23 13:59:09,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:59:09,905 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-23 13:59:09,927 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-23 13:59:09,928 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-23 13:59:09,943 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-23 13:59:09,943 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-23 13:59:09,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:59:09,969 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-23 13:59:09,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 178 [2022-11-23 13:59:09,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 161 treesize of output 153 [2022-11-23 13:59:10,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:59:10,014 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-23 13:59:10,030 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-23 13:59:11,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:59:11,420 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-23 13:59:11,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:59:11,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-23 13:59:11,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:59:11,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:59:11,440 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-23 13:59:11,444 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:59:11,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:59:11,456 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-23 13:59:11,499 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:59:11,499 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-23 13:59:11,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:59:11,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:59:11,510 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-23 13:59:25,774 WARN L233 SmtUtils]: Spent 14.18s 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-23 13:59:25,797 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-23 13:59:25,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:59:25,866 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-23 13:59:26,531 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-23 13:59:26,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397951857] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:59:26,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [80695729] [2022-11-23 13:59:26,532 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-11-23 13:59:26,532 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:59:26,533 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-23 13:59:26,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:59:26,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 35 [2022-11-23 13:59:26,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665272560] [2022-11-23 13:59:26,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:59:26,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-23 13:59:26,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:59:26,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-23 13:59:26,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1131, Unknown=19, NotChecked=0, Total=1260 [2022-11-23 13:59:26,535 INFO L87 Difference]: Start difference. First operand 266 states and 308 transitions. Second operand has 36 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 29 states have internal predecessors, (72), 13 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-23 13:59:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:59:30,231 INFO L93 Difference]: Finished difference Result 265 states and 307 transitions. [2022-11-23 13:59:30,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 13:59:30,232 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-23 13:59:30,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:59:30,234 INFO L225 Difference]: With dead ends: 265 [2022-11-23 13:59:30,234 INFO L226 Difference]: Without dead ends: 265 [2022-11-23 13:59:30,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=271, Invalid=1962, Unknown=23, NotChecked=0, Total=2256 [2022-11-23 13:59:30,235 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 96 mSDsluCounter, 2760 mSDsCounter, 0 mSdLazyCounter, 2496 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 2958 SdHoareTripleChecker+Invalid, 2551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:59:30,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 2958 Invalid, 2551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2496 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-23 13:59:30,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-23 13:59:30,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2022-11-23 13:59:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 147 states have (on average 1.6938775510204083) internal successors, (249), 234 states have internal predecessors, (249), 31 states have call successors, (31), 11 states have call predecessors, (31), 15 states have return successors, (27), 22 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-23 13:59:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 307 transitions. [2022-11-23 13:59:30,242 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 307 transitions. Word has length 63 [2022-11-23 13:59:30,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:59:30,243 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 307 transitions. [2022-11-23 13:59:30,243 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-23 13:59:30,243 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 307 transitions. [2022-11-23 13:59:30,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 13:59:30,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:59:30,244 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-23 13:59:30,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 13:59:30,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-23 13:59:30,452 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting dll_insert_masterErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 13:59:30,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:59:30,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1632937661, now seen corresponding path program 1 times [2022-11-23 13:59:30,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:59:30,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502980287] [2022-11-23 13:59:30,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:59:30,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:59:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:59:32,232 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-23 13:59:32,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:59:32,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502980287] [2022-11-23 13:59:32,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502980287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:59:32,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593159842] [2022-11-23 13:59:32,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:59:32,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:59:32,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:59:32,235 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:59:32,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 13:59:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:59:32,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-23 13:59:32,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:59:32,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 13:59:33,130 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-23 13:59:33,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 13:59:33,616 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-23 13:59:36,394 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-23 13:59:36,403 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-23 13:59:36,409 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-23 13:59:36,417 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-23 13:59:36,422 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-23 13:59:38,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:59:38,932 INFO L321 Elim1Store]: treesize reduction 152, result has 25.1 percent of original size [2022-11-23 13:59:38,932 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 226 treesize of output 255 [2022-11-23 13:59:39,179 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-23 13:59:39,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:59:40,264 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:59:40,265 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-23 13:59:40,275 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-23 13:59:40,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593159842] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:59:40,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [26404804] [2022-11-23 13:59:40,446 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-23 13:59:40,446 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:59:40,447 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-23 13:59:40,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 13:59:40,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 30] total 37 [2022-11-23 13:59:40,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553946881] [2022-11-23 13:59:40,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 13:59:40,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-23 13:59:40,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:59:40,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-23 13:59:40,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1331, Unknown=5, NotChecked=0, Total=1482 [2022-11-23 13:59:40,449 INFO L87 Difference]: Start difference. First operand 265 states and 307 transitions. Second operand has 38 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-23 13:59:47,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:59:49,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:59:54,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:59:59,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:00:01,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:00:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:00:14,891 INFO L93 Difference]: Finished difference Result 281 states and 329 transitions. [2022-11-23 14:00:14,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-23 14:00:14,892 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-23 14:00:14,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:00:14,893 INFO L225 Difference]: With dead ends: 281 [2022-11-23 14:00:14,893 INFO L226 Difference]: Without dead ends: 281 [2022-11-23 14:00:14,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=471, Invalid=4071, Unknown=14, NotChecked=0, Total=4556 [2022-11-23 14:00:14,895 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 207 mSDsluCounter, 1817 mSDsCounter, 0 mSdLazyCounter, 3717 mSolverCounterSat, 66 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 3801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3717 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:00:14,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1951 Invalid, 3801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3717 Invalid, 18 Unknown, 0 Unchecked, 18.1s Time] [2022-11-23 14:00:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-23 14:00:14,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2022-11-23 14:00:14,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 149 states have (on average 1.6979865771812082) internal successors, (253), 236 states have internal predecessors, (253), 31 states have call successors, (31), 11 states have call predecessors, (31), 15 states have return successors, (27), 22 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-23 14:00:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 311 transitions. [2022-11-23 14:00:14,903 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 311 transitions. Word has length 62 [2022-11-23 14:00:14,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:00:14,903 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 311 transitions. [2022-11-23 14:00:14,903 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-23 14:00:14,904 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 311 transitions. [2022-11-23 14:00:14,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 14:00:14,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:00:14,904 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-23 14:00:14,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 14:00:15,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:00:15,111 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting dll_insert_masterErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:00:15,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:00:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1632937660, now seen corresponding path program 1 times [2022-11-23 14:00:15,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:00:15,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065363257] [2022-11-23 14:00:15,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:00:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:00:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:00:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 5 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:00:21,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:00:21,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065363257] [2022-11-23 14:00:21,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065363257] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:00:21,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198366100] [2022-11-23 14:00:21,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:00:21,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:00:21,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:00:21,727 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:00:21,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 14:00:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:00:22,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-23 14:00:22,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:00:22,580 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-23 14:00:22,583 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-23 14:00:23,142 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:00:23,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:00:23,249 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4096 Int) (|##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|) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4096)))) is different from true [2022-11-23 14:00:23,497 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:00:23,497 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-23 14:00:23,509 WARN L859 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_4097 Int)) (and (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4097) |c_#length|) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-23 14:00:26,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:00:26,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:00:26,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:00:26,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:00:26,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:00:26,130 INFO L321 Elim1Store]: treesize reduction 56, result has 37.8 percent of original size [2022-11-23 14:00:26,131 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-23 14:00:26,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:00:26,155 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-11-23 14:00:26,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 18 [2022-11-23 14:00:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 25 not checked. [2022-11-23 14:00:26,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:00:33,046 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:00:33,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198366100] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:00:33,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1726128590] [2022-11-23 14:00:33,049 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-23 14:00:33,050 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:00:33,050 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-23 14:00:33,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:00:33,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 20] total 55 [2022-11-23 14:00:33,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559661049] [2022-11-23 14:00:33,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:00:33,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-23 14:00:33,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:00:33,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-23 14:00:33,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2745, Unknown=2, NotChecked=214, Total=3192 [2022-11-23 14:00:33,052 INFO L87 Difference]: Start difference. First operand 267 states and 311 transitions. Second operand has 56 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 46 states have internal predecessors, (96), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-23 14:00:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:00:48,532 INFO L93 Difference]: Finished difference Result 280 states and 323 transitions. [2022-11-23 14:00:48,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-23 14:00:48,533 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 46 states have internal predecessors, (96), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 62 [2022-11-23 14:00:48,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:00:48,534 INFO L225 Difference]: With dead ends: 280 [2022-11-23 14:00:48,535 INFO L226 Difference]: Without dead ends: 280 [2022-11-23 14:00:48,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=689, Invalid=6626, Unknown=3, NotChecked=338, Total=7656 [2022-11-23 14:00:48,537 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 374 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 4143 mSolverCounterSat, 142 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 4787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 4143 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 488 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:00:48,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1890 Invalid, 4787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 4143 Invalid, 14 Unknown, 488 Unchecked, 6.4s Time] [2022-11-23 14:00:48,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-23 14:00:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 259. [2022-11-23 14:00:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 231 states have internal predecessors, (245), 31 states have call successors, (31), 11 states have call predecessors, (31), 13 states have return successors, (23), 19 states have call predecessors, (23), 17 states have call successors, (23) [2022-11-23 14:00:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 299 transitions. [2022-11-23 14:00:48,545 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 299 transitions. Word has length 62 [2022-11-23 14:00:48,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:00:48,546 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 299 transitions. [2022-11-23 14:00:48,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 46 states have internal predecessors, (96), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-23 14:00:48,546 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 299 transitions. [2022-11-23 14:00:48,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-23 14:00:48,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:00:48,548 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-23 14:00:48,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-23 14:00:48,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:00:48,756 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:00:48,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:00:48,756 INFO L85 PathProgramCache]: Analyzing trace with hash -467489353, now seen corresponding path program 1 times [2022-11-23 14:00:48,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:00:48,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397814875] [2022-11-23 14:00:48,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:00:48,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:00:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:00:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 129 proven. 10 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-11-23 14:00:51,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:00:51,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397814875] [2022-11-23 14:00:51,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397814875] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:00:51,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390655068] [2022-11-23 14:00:51,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:00:51,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:00:51,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:00:51,979 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:00:51,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 14:00:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:00:52,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-23 14:00:52,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:00:52,611 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-23 14:00:53,110 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4652 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4652))) is different from true [2022-11-23 14:00:53,116 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4652 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_4652))) is different from true [2022-11-23 14:00:53,311 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-23 14:00:53,746 INFO L321 Elim1Store]: treesize reduction 281, result has 15.9 percent of original size [2022-11-23 14:00:53,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 54 treesize of output 82 [2022-11-23 14:00:53,826 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 132 proven. 24 refuted. 0 times theorem prover too weak. 41 trivial. 34 not checked. [2022-11-23 14:00:53,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:00:54,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390655068] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:00:54,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [839514401] [2022-11-23 14:00:54,569 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-23 14:00:54,569 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:00:54,569 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-23 14:00:54,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:00:54,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22] total 30 [2022-11-23 14:00:54,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461912091] [2022-11-23 14:00:54,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:00:54,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-23 14:00:54,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:00:54,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 14:00:54,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=691, Unknown=3, NotChecked=168, Total=992 [2022-11-23 14:00:54,571 INFO L87 Difference]: Start difference. First operand 259 states and 299 transitions. Second operand has 31 states, 26 states have (on average 4.0) internal successors, (104), 28 states have internal predecessors, (104), 12 states have call successors, (17), 2 states have call predecessors, (17), 8 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) [2022-11-23 14:01:04,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:01:04,888 INFO L93 Difference]: Finished difference Result 288 states and 338 transitions. [2022-11-23 14:01:04,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 14:01:04,888 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 4.0) internal successors, (104), 28 states have internal predecessors, (104), 12 states have call successors, (17), 2 states have call predecessors, (17), 8 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) Word has length 124 [2022-11-23 14:01:04,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:01:04,890 INFO L225 Difference]: With dead ends: 288 [2022-11-23 14:01:04,890 INFO L226 Difference]: Without dead ends: 288 [2022-11-23 14:01:04,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=254, Invalid=1559, Unknown=5, NotChecked=252, Total=2070 [2022-11-23 14:01:04,891 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 212 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 77 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 786 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:01:04,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 980 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2065 Invalid, 18 Unknown, 786 Unchecked, 4.4s Time] [2022-11-23 14:01:04,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-23 14:01:04,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 270. [2022-11-23 14:01:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 151 states have (on average 1.7086092715231789) internal successors, (258), 238 states have internal predecessors, (258), 32 states have call successors, (32), 11 states have call predecessors, (32), 15 states have return successors, (28), 23 states have call predecessors, (28), 18 states have call successors, (28) [2022-11-23 14:01:04,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 318 transitions. [2022-11-23 14:01:04,900 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 318 transitions. Word has length 124 [2022-11-23 14:01:04,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:01:04,900 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 318 transitions. [2022-11-23 14:01:04,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 4.0) internal successors, (104), 28 states have internal predecessors, (104), 12 states have call successors, (17), 2 states have call predecessors, (17), 8 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) [2022-11-23 14:01:04,901 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 318 transitions. [2022-11-23 14:01:04,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-23 14:01:04,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:01:04,902 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-23 14:01:04,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-23 14:01:05,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:01:05,112 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting dll_insert_masterErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:01:05,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:01:05,112 INFO L85 PathProgramCache]: Analyzing trace with hash -467489352, now seen corresponding path program 1 times [2022-11-23 14:01:05,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:01:05,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672965570] [2022-11-23 14:01:05,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:01:05,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:01:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:01:19,481 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 54 proven. 170 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 14:01:19,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:01:19,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672965570] [2022-11-23 14:01:19,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672965570] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:01:19,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225135654] [2022-11-23 14:01:19,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:01:19,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:01:19,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:01:19,483 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:01:19,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-23 14:01:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:01:20,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-23 14:01:20,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:01:20,806 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-23 14:01:20,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:01:21,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:21,728 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-23 14:01:22,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:22,254 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 14:01:22,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-11-23 14:01:23,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:23,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:23,350 INFO L321 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-11-23 14:01:23,351 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 112 treesize of output 110 [2022-11-23 14:01:23,813 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_5196 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_5204 Int) (v_ArrVal_5203 Int) (v_ArrVal_5201 Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_361| Int) (v_ArrVal_5199 Int) (v_ArrVal_5198 Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_362| Int)) (let ((.cse1 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| 1))) (let ((.cse0 (store .cse1 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_361| v_ArrVal_5198))) (let ((.cse2 (store .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) (and (< |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_361| |c_#StackHeapBarrier|) (= |c_#length| (store (store (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_5196) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_361| v_ArrVal_5199) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5201) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_5203) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_362| v_ArrVal_5204)) (< |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|) (= (select .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_361|) 0) (= (select (store .cse2 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| 1) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_362|) 0) (= (select .cse2 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 0)))))))) is different from true [2022-11-23 14:01:23,990 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5196 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_5204 Int) (v_ArrVal_5203 Int) (v_ArrVal_5201 Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_361| Int) (v_ArrVal_5199 Int) (v_ArrVal_5198 Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_362| Int)) (let ((.cse1 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| 1))) (let ((.cse0 (store .cse1 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_361| v_ArrVal_5198))) (let ((.cse2 (store .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) (and (< |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_361| |c_#StackHeapBarrier|) (= |c_#length| (store (store (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_5196) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_361| v_ArrVal_5199) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5201) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_5203) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_362| v_ArrVal_5204)) (< |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|) (= (select .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_361|) 0) (= (select (store .cse2 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| 1) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_362|) 0) (= (select .cse2 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 0)))))) is different from true [2022-11-23 14:01:24,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:24,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:24,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:24,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:24,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:24,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:24,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:24,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:24,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:24,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:24,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:24,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:24,108 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-23 14:01:24,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 46 [2022-11-23 14:01:24,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:24,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:24,188 INFO L321 Elim1Store]: treesize reduction 55, result has 32.1 percent of original size [2022-11-23 14:01:24,189 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 211 treesize of output 224 [2022-11-23 14:01:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 98 proven. 99 refuted. 0 times theorem prover too weak. 26 trivial. 8 not checked. [2022-11-23 14:01:24,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:01:28,093 WARN L837 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_5261 Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_390| Int) (|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_391| Int) (v_ArrVal_5266 Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_356| Int) (|v_dll_create_generic_~#dll~0.base_218| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_355| Int)) (let ((.cse1 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_218| v_ArrVal_5266))) (let ((.cse2 (store .cse1 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_390| v_ArrVal_5261))) (let ((.cse0 (store .cse2 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_356| 1))) (or (not (< |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_391| |c_#StackHeapBarrier|)) (not (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_391|) 0)) (not (= (select (store .cse0 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_391| 1) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_355|) 0)) (not (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_390|) 0)) (not (= (select .cse2 |v_dll_create_generic_~#dll~0.base_218|) 1)) (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_218|)) (not (< |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_390| |c_#StackHeapBarrier|)) (not (= (select .cse2 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_356|) 0))))))) (<= 0 (+ |c_dll_insert_master_~item~1#1.offset| 8))) (forall ((|v_dll_create_generic_~#dll~0.base_218| Int)) (or (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_218|)) (forall ((|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_391| Int)) (or (not (< |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_391| |c_#StackHeapBarrier|)) (forall ((|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_390| Int)) (or (not (< |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_390| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5266 Int)) (let ((.cse3 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_218| v_ArrVal_5266))) (or (not (= (select .cse3 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_390|) 0)) (forall ((v_ArrVal_5261 Int)) (let ((.cse5 (store .cse3 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_390| v_ArrVal_5261))) (or (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_356| Int)) (let ((.cse4 (store .cse5 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_356| 1))) (or (not (= (select .cse4 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_391|) 0)) (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_355| Int)) (or (forall ((v_ArrVal_5262 Int) (v_ArrVal_5260 Int) (v_ArrVal_5265 Int) (v_ArrVal_5264 Int) (v_ArrVal_5263 Int)) (<= (+ |c_dll_insert_master_~item~1#1.offset| 12) (select (store (store (store (store (store |c_#length| |v_dll_create_generic_~#dll~0.base_218| v_ArrVal_5260) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_390| v_ArrVal_5262) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_356| v_ArrVal_5263) |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_391| v_ArrVal_5264) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_355| v_ArrVal_5265) |c_dll_insert_master_~item~1#1.base|))) (not (= (select (store .cse4 |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_391| 1) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_355|) 0)))) (not (= (select .cse5 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_356|) 0))))) (not (= (select .cse5 |v_dll_create_generic_~#dll~0.base_218|) 1))))))))))))))) is different from false [2022-11-23 14:01:28,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225135654] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:01:28,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1710256029] [2022-11-23 14:01:28,098 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-23 14:01:28,099 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:01:28,099 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-23 14:01:28,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:01:28,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 25] total 87 [2022-11-23 14:01:28,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756086827] [2022-11-23 14:01:28,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:01:28,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-11-23 14:01:28,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:01:28,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-11-23 14:01:28,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=7005, Unknown=6, NotChecked=516, Total=8010 [2022-11-23 14:01:28,102 INFO L87 Difference]: Start difference. First operand 270 states and 318 transitions. Second operand has 88 states, 79 states have (on average 2.3037974683544302) internal successors, (182), 79 states have internal predecessors, (182), 21 states have call successors, (26), 6 states have call predecessors, (26), 19 states have return successors, (24), 20 states have call predecessors, (24), 19 states have call successors, (24) [2022-11-23 14:02:22,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:02:22,525 INFO L93 Difference]: Finished difference Result 314 states and 378 transitions. [2022-11-23 14:02:22,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-23 14:02:22,526 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 79 states have (on average 2.3037974683544302) internal successors, (182), 79 states have internal predecessors, (182), 21 states have call successors, (26), 6 states have call predecessors, (26), 19 states have return successors, (24), 20 states have call predecessors, (24), 19 states have call successors, (24) Word has length 124 [2022-11-23 14:02:22,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:02:22,528 INFO L225 Difference]: With dead ends: 314 [2022-11-23 14:02:22,528 INFO L226 Difference]: Without dead ends: 314 [2022-11-23 14:02:22,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4729 ImplicationChecksByTransitivity, 52.0s TimeCoverageRelationStatistics Valid=1338, Invalid=15951, Unknown=15, NotChecked=786, Total=18090 [2022-11-23 14:02:22,531 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 478 mSDsluCounter, 2993 mSDsCounter, 0 mSdLazyCounter, 8254 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 9067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 8254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 570 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:02:22,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 3134 Invalid, 9067 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [243 Valid, 8254 Invalid, 0 Unknown, 570 Unchecked, 14.0s Time] [2022-11-23 14:02:22,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-11-23 14:02:22,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 274. [2022-11-23 14:02:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 153 states have (on average 1.6862745098039216) internal successors, (258), 241 states have internal predecessors, (258), 32 states have call successors, (32), 11 states have call predecessors, (32), 17 states have return successors, (32), 24 states have call predecessors, (32), 18 states have call successors, (32) [2022-11-23 14:02:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 322 transitions. [2022-11-23 14:02:22,540 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 322 transitions. Word has length 124 [2022-11-23 14:02:22,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:02:22,540 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 322 transitions. [2022-11-23 14:02:22,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 79 states have (on average 2.3037974683544302) internal successors, (182), 79 states have internal predecessors, (182), 21 states have call successors, (26), 6 states have call predecessors, (26), 19 states have return successors, (24), 20 states have call predecessors, (24), 19 states have call successors, (24) [2022-11-23 14:02:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 322 transitions. [2022-11-23 14:02:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-23 14:02:22,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:02:22,542 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-23 14:02:22,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-23 14:02:22,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-23 14:02:22,751 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-23 14:02:22,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:02:22,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1607248883, now seen corresponding path program 1 times [2022-11-23 14:02:22,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:02:22,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334709695] [2022-11-23 14:02:22,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:02:22,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:02:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:02:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 175 proven. 37 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-23 14:02:29,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:02:29,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334709695] [2022-11-23 14:02:29,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334709695] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:02:29,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163493929] [2022-11-23 14:02:29,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:02:29,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:02:29,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:02:29,074 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:02:29,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-23 14:02:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:02:29,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-23 14:02:29,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:02:30,329 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:02:30,329 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 12 treesize of output 14 [2022-11-23 14:02:30,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 5 treesize of output 3 [2022-11-23 14:02:30,642 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-23 14:02:30,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:02:31,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:31,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:31,098 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-23 14:02:31,108 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_5799 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5799) |c_#length|)))) is different from true [2022-11-23 14:02:31,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:31,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:31,383 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-23 14:02:31,392 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_5800 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5800) |c_#length|)))) is different from true [2022-11-23 14:02:32,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:32,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:32,004 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-23 14:02:32,016 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5801 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5801) |c_#length|) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-23 14:02:38,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:38,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:38,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:38,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:38,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:38,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:38,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:38,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:38,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:38,904 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-23 14:02:38,904 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-23 14:02:38,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:38,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:38,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:02:38,932 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 14:02:38,932 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-23 14:02:39,045 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 117 proven. 41 refuted. 0 times theorem prover too weak. 17 trivial. 57 not checked. [2022-11-23 14:02:39,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:02:45,916 WARN L233 SmtUtils]: Spent 6.07s 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-23 14:02:45,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163493929] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:02:45,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [798109576] [2022-11-23 14:02:45,919 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-23 14:02:45,919 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:02:45,919 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-23 14:02:45,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:02:45,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 26] total 62 [2022-11-23 14:02:45,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098189548] [2022-11-23 14:02:45,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:02:45,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-23 14:02:45,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:02:45,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-23 14:02:45,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=3385, Unknown=3, NotChecked=360, Total=4032 [2022-11-23 14:02:45,922 INFO L87 Difference]: Start difference. First operand 274 states and 322 transitions. Second operand has 63 states, 54 states have (on average 2.9444444444444446) internal successors, (159), 55 states have internal predecessors, (159), 20 states have call successors, (26), 8 states have call predecessors, (26), 13 states have return successors, (21), 16 states have call predecessors, (21), 17 states have call successors, (21) [2022-11-23 14:02:50,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:02:51,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:03:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:03:06,562 INFO L93 Difference]: Finished difference Result 275 states and 322 transitions. [2022-11-23 14:03:06,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 14:03:06,563 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 54 states have (on average 2.9444444444444446) internal successors, (159), 55 states have internal predecessors, (159), 20 states have call successors, (26), 8 states have call predecessors, (26), 13 states have return successors, (21), 16 states have call predecessors, (21), 17 states have call successors, (21) Word has length 125 [2022-11-23 14:03:06,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:03:06,564 INFO L225 Difference]: With dead ends: 275 [2022-11-23 14:03:06,564 INFO L226 Difference]: Without dead ends: 275 [2022-11-23 14:03:06,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1898 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=562, Invalid=5763, Unknown=7, NotChecked=474, Total=6806 [2022-11-23 14:03:06,566 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 315 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 3339 mSolverCounterSat, 113 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 4194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 3339 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 731 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:03:06,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 2040 Invalid, 4194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 3339 Invalid, 11 Unknown, 731 Unchecked, 8.4s Time] [2022-11-23 14:03:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-23 14:03:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 270. [2022-11-23 14:03:06,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 149 states have (on average 1.691275167785235) internal successors, (252), 239 states have internal predecessors, (252), 32 states have call successors, (32), 11 states have call predecessors, (32), 17 states have return successors, (32), 22 states have call predecessors, (32), 18 states have call successors, (32) [2022-11-23 14:03:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 316 transitions. [2022-11-23 14:03:06,573 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 316 transitions. Word has length 125 [2022-11-23 14:03:06,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:03:06,574 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 316 transitions. [2022-11-23 14:03:06,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 54 states have (on average 2.9444444444444446) internal successors, (159), 55 states have internal predecessors, (159), 20 states have call successors, (26), 8 states have call predecessors, (26), 13 states have return successors, (21), 16 states have call predecessors, (21), 17 states have call successors, (21) [2022-11-23 14:03:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 316 transitions. [2022-11-23 14:03:06,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-23 14:03:06,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:03:06,576 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:03:06,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-23 14:03:06,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-23 14:03:06,785 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:03:06,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:03:06,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1888233152, now seen corresponding path program 1 times [2022-11-23 14:03:06,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:03:06,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550540649] [2022-11-23 14:03:06,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:03:06,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:03:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:03:07,405 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-23 14:03:07,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:03:07,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550540649] [2022-11-23 14:03:07,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550540649] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:03:07,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309924164] [2022-11-23 14:03:07,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:03:07,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:03:07,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:03:07,407 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:03:07,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-23 14:03:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:03:08,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-23 14:03:08,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:03:08,094 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-23 14:03:08,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 16 treesize of output 8 [2022-11-23 14:03:08,143 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-23 14:03:08,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:03:08,510 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-23 14:03:08,522 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-23 14:03:08,655 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-23 14:03:08,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309924164] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:03:08,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1464218687] [2022-11-23 14:03:08,657 INFO L159 IcfgInterpreter]: Started Sifa with 42 locations of interest [2022-11-23 14:03:08,657 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:03:08,658 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-23 14:03:08,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:03:08,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 15 [2022-11-23 14:03:08,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701833936] [2022-11-23 14:03:08,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:03:08,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 14:03:08,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:03:08,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 14:03:08,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-23 14:03:08,660 INFO L87 Difference]: Start difference. First operand 270 states and 316 transitions. Second operand has 15 states, 11 states have (on average 4.545454545454546) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-23 14:03:09,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:03:09,462 INFO L93 Difference]: Finished difference Result 370 states and 428 transitions. [2022-11-23 14:03:09,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 14:03:09,463 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 4.545454545454546) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) Word has length 109 [2022-11-23 14:03:09,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:03:09,465 INFO L225 Difference]: With dead ends: 370 [2022-11-23 14:03:09,465 INFO L226 Difference]: Without dead ends: 370 [2022-11-23 14:03:09,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 217 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-23 14:03:09,465 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 153 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 14:03:09,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 2134 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 14:03:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-11-23 14:03:09,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 295. [2022-11-23 14:03:09,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 173 states have (on average 1.7341040462427746) internal successors, (300), 262 states have internal predecessors, (300), 32 states have call successors, (32), 12 states have call predecessors, (32), 18 states have return successors, (32), 22 states have call predecessors, (32), 18 states have call successors, (32) [2022-11-23 14:03:09,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 364 transitions. [2022-11-23 14:03:09,475 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 364 transitions. Word has length 109 [2022-11-23 14:03:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:03:09,475 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 364 transitions. [2022-11-23 14:03:09,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 4.545454545454546) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-23 14:03:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 364 transitions. [2022-11-23 14:03:09,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-23 14:03:09,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:03:09,477 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:03:09,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-23 14:03:09,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-23 14:03:09,686 INFO L420 AbstractCegarLoop]: === Iteration 36 === 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-23 14:03:09,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:03:09,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1888244770, now seen corresponding path program 1 times [2022-11-23 14:03:09,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:03:09,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633870854] [2022-11-23 14:03:09,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:03:09,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:03:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:03:10,800 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-23 14:03:10,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:03:10,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633870854] [2022-11-23 14:03:10,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633870854] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:03:10,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386345931] [2022-11-23 14:03:10,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:03:10,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:03:10,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:03:10,802 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:03:10,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-23 14:03:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:03:11,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-23 14:03:11,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:03:11,680 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-23 14:03:11,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:03:11,836 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-23 14:03:11,840 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-23 14:03:11,894 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-23 14:03:11,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:03:12,329 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-23 14:03:12,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 62 treesize of output 54 [2022-11-23 14:03:12,507 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 14:03:12,507 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-23 14:03:12,641 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-23 14:03:12,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 30 treesize of output 26 [2022-11-23 14:03:12,783 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-23 14:03:13,033 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-23 14:03:13,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386345931] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:03:13,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1853217600] [2022-11-23 14:03:13,035 INFO L159 IcfgInterpreter]: Started Sifa with 42 locations of interest [2022-11-23 14:03:13,035 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:03:13,035 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-23 14:03:13,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:03:13,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 35 [2022-11-23 14:03:13,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721289347] [2022-11-23 14:03:13,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:03:13,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-23 14:03:13,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:03:13,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-23 14:03:13,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1165, Unknown=0, NotChecked=0, Total=1260 [2022-11-23 14:03:13,039 INFO L87 Difference]: Start difference. First operand 295 states and 364 transitions. Second operand has 36 states, 25 states have (on average 3.52) internal successors, (88), 32 states have internal predecessors, (88), 13 states have call successors, (20), 3 states have call predecessors, (20), 11 states have return successors, (21), 15 states have call predecessors, (21), 12 states have call successors, (21) [2022-11-23 14:03:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:03:15,946 INFO L93 Difference]: Finished difference Result 308 states and 359 transitions. [2022-11-23 14:03:15,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 14:03:15,946 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 25 states have (on average 3.52) internal successors, (88), 32 states have internal predecessors, (88), 13 states have call successors, (20), 3 states have call predecessors, (20), 11 states have return successors, (21), 15 states have call predecessors, (21), 12 states have call successors, (21) Word has length 109 [2022-11-23 14:03:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:03:15,948 INFO L225 Difference]: With dead ends: 308 [2022-11-23 14:03:15,948 INFO L226 Difference]: Without dead ends: 308 [2022-11-23 14:03:15,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 208 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-23 14:03:15,949 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 384 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 3618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:03:15,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1907 Invalid, 3618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 3528 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-23 14:03:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-11-23 14:03:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 290. [2022-11-23 14:03:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 174 states have (on average 1.6666666666666667) internal successors, (290), 257 states have internal predecessors, (290), 32 states have call successors, (32), 12 states have call predecessors, (32), 18 states have return successors, (32), 22 states have call predecessors, (32), 18 states have call successors, (32) [2022-11-23 14:03:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 354 transitions. [2022-11-23 14:03:15,958 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 354 transitions. Word has length 109 [2022-11-23 14:03:15,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:03:15,958 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 354 transitions. [2022-11-23 14:03:15,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 25 states have (on average 3.52) internal successors, (88), 32 states have internal predecessors, (88), 13 states have call successors, (20), 3 states have call predecessors, (20), 11 states have return successors, (21), 15 states have call predecessors, (21), 12 states have call successors, (21) [2022-11-23 14:03:15,959 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 354 transitions. [2022-11-23 14:03:15,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-23 14:03:15,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:03:15,960 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:03:15,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-23 14:03:16,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:03:16,172 INFO L420 AbstractCegarLoop]: === Iteration 37 === 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-23 14:03:16,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:03:16,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1888244769, now seen corresponding path program 1 times [2022-11-23 14:03:16,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:03:16,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924437638] [2022-11-23 14:03:16,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:03:16,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:03:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:03:17,071 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-23 14:03:17,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:03:17,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924437638] [2022-11-23 14:03:17,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924437638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:03:17,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328060594] [2022-11-23 14:03:17,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:03:17,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:03:17,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:03:17,073 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:03:17,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-23 14:03:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:03:17,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-23 14:03:17,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:03:17,922 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-23 14:03:17,926 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-23 14:03:17,986 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-23 14:03:17,988 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-23 14:03:18,018 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-23 14:03:18,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:03:18,860 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-23 14:03:18,863 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-23 14:03:18,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:03:18,873 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-23 14:03:18,929 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-23 14:03:18,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:03:18,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:03:18,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:03:18,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:03:18,989 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-23 14:03:19,196 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-23 14:03:19,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328060594] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:03:19,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1758603413] [2022-11-23 14:03:19,198 INFO L159 IcfgInterpreter]: Started Sifa with 42 locations of interest [2022-11-23 14:03:19,198 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:03:19,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-23 14:03:19,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:03:19,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 27 [2022-11-23 14:03:19,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811418367] [2022-11-23 14:03:19,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:03:19,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-23 14:03:19,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:03:19,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-23 14:03:19,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-11-23 14:03:19,201 INFO L87 Difference]: Start difference. First operand 290 states and 354 transitions. Second operand has 28 states, 20 states have (on average 3.45) internal successors, (69), 24 states have internal predecessors, (69), 7 states have call successors, (13), 3 states have call predecessors, (13), 7 states have return successors, (15), 11 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-23 14:03:20,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:03:20,742 INFO L93 Difference]: Finished difference Result 350 states and 408 transitions. [2022-11-23 14:03:20,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 14:03:20,743 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 20 states have (on average 3.45) internal successors, (69), 24 states have internal predecessors, (69), 7 states have call successors, (13), 3 states have call predecessors, (13), 7 states have return successors, (15), 11 states have call predecessors, (15), 5 states have call successors, (15) Word has length 109 [2022-11-23 14:03:20,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:03:20,744 INFO L225 Difference]: With dead ends: 350 [2022-11-23 14:03:20,745 INFO L226 Difference]: Without dead ends: 350 [2022-11-23 14:03:20,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 205 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-23 14:03:20,745 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 246 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 1961 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:03:20,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 2060 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1961 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-23 14:03:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-11-23 14:03:20,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 312. [2022-11-23 14:03:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 197 states have (on average 1.6903553299492386) internal successors, (333), 279 states have internal predecessors, (333), 32 states have call successors, (32), 12 states have call predecessors, (32), 18 states have return successors, (32), 22 states have call predecessors, (32), 18 states have call successors, (32) [2022-11-23 14:03:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 397 transitions. [2022-11-23 14:03:20,754 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 397 transitions. Word has length 109 [2022-11-23 14:03:20,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:03:20,754 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 397 transitions. [2022-11-23 14:03:20,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 20 states have (on average 3.45) internal successors, (69), 24 states have internal predecessors, (69), 7 states have call successors, (13), 3 states have call predecessors, (13), 7 states have return successors, (15), 11 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-23 14:03:20,755 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 397 transitions. [2022-11-23 14:03:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-11-23 14:03:20,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:03:20,756 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:03:20,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-23 14:03:20,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-23 14:03:20,964 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:03:20,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:03:20,965 INFO L85 PathProgramCache]: Analyzing trace with hash 304190689, now seen corresponding path program 1 times [2022-11-23 14:03:20,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:03:20,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61736640] [2022-11-23 14:03:20,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:03:20,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:03:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:03:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-23 14:03:22,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:03:22,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61736640] [2022-11-23 14:03:22,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61736640] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:03:22,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618825026] [2022-11-23 14:03:22,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:03:22,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:03:22,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:03:22,419 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:03:22,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-23 14:03:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:03:23,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 1307 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-23 14:03:23,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:03:23,259 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-23 14:03:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 33 proven. 32 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-23 14:03:23,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:03:24,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618825026] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:03:24,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1155371371] [2022-11-23 14:03:24,449 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2022-11-23 14:03:24,449 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:03:24,449 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-23 14:03:24,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:03:24,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 36 [2022-11-23 14:03:24,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542416925] [2022-11-23 14:03:24,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:03:24,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-23 14:03:24,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:03:24,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-23 14:03:24,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1230, Unknown=9, NotChecked=0, Total=1332 [2022-11-23 14:03:24,452 INFO L87 Difference]: Start difference. First operand 312 states and 397 transitions. Second operand has 36 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 30 states have internal predecessors, (75), 12 states have call successors, (17), 5 states have call predecessors, (17), 11 states have return successors, (17), 13 states have call predecessors, (17), 10 states have call successors, (17) [2022-11-23 14:03:40,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:03:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:03:44,287 INFO L93 Difference]: Finished difference Result 319 states and 398 transitions. [2022-11-23 14:03:44,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 14:03:44,287 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 30 states have internal predecessors, (75), 12 states have call successors, (17), 5 states have call predecessors, (17), 11 states have return successors, (17), 13 states have call predecessors, (17), 10 states have call successors, (17) Word has length 126 [2022-11-23 14:03:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:03:44,289 INFO L225 Difference]: With dead ends: 319 [2022-11-23 14:03:44,290 INFO L226 Difference]: Without dead ends: 316 [2022-11-23 14:03:44,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=238, Invalid=2600, Unknown=24, NotChecked=0, Total=2862 [2022-11-23 14:03:44,291 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 147 mSDsluCounter, 3007 mSDsCounter, 0 mSdLazyCounter, 3861 mSolverCounterSat, 44 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 3146 SdHoareTripleChecker+Invalid, 3923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3861 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-23 14:03:44,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 3146 Invalid, 3923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3861 Invalid, 18 Unknown, 0 Unchecked, 4.7s Time] [2022-11-23 14:03:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-11-23 14:03:44,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 301. [2022-11-23 14:03:44,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 191 states have (on average 1.712041884816754) internal successors, (327), 271 states have internal predecessors, (327), 32 states have call successors, (32), 12 states have call predecessors, (32), 13 states have return successors, (21), 19 states have call predecessors, (21), 18 states have call successors, (21) [2022-11-23 14:03:44,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 380 transitions. [2022-11-23 14:03:44,299 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 380 transitions. Word has length 126 [2022-11-23 14:03:44,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:03:44,299 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 380 transitions. [2022-11-23 14:03:44,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 30 states have internal predecessors, (75), 12 states have call successors, (17), 5 states have call predecessors, (17), 11 states have return successors, (17), 13 states have call predecessors, (17), 10 states have call successors, (17) [2022-11-23 14:03:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 380 transitions. [2022-11-23 14:03:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-23 14:03:44,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:03:44,301 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-23 14:03:44,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-23 14:03:44,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1768a35a-6d7d-439a-911c-86d35696ce3f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-23 14:03:44,511 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-23 14:03:44,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:03:44,511 INFO L85 PathProgramCache]: Analyzing trace with hash -639195791, now seen corresponding path program 1 times [2022-11-23 14:03:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:03:44,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533088300] [2022-11-23 14:03:44,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:03:44,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:03:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat