./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta --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 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf --- 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-dbf71c6-m [2022-10-17 17:10:57,975 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 17:10:57,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 17:10:58,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 17:10:58,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 17:10:58,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 17:10:58,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 17:10:58,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 17:10:58,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 17:10:58,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 17:10:58,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 17:10:58,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 17:10:58,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 17:10:58,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 17:10:58,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 17:10:58,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 17:10:58,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 17:10:58,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 17:10:58,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 17:10:58,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 17:10:58,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 17:10:58,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 17:10:58,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 17:10:58,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 17:10:58,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 17:10:58,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 17:10:58,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 17:10:58,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 17:10:58,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 17:10:58,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 17:10:58,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 17:10:58,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 17:10:58,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 17:10:58,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 17:10:58,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 17:10:58,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 17:10:58,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 17:10:58,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 17:10:58,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 17:10:58,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 17:10:58,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 17:10:58,121 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-10-17 17:10:58,192 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 17:10:58,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 17:10:58,193 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 17:10:58,194 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 17:10:58,195 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 17:10:58,195 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 17:10:58,195 INFO L138 SettingsManager]: * User list type=DISABLED [2022-10-17 17:10:58,195 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-10-17 17:10:58,196 INFO L138 SettingsManager]: * Explicit value domain=true [2022-10-17 17:10:58,196 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-10-17 17:10:58,197 INFO L138 SettingsManager]: * Octagon Domain=false [2022-10-17 17:10:58,197 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-10-17 17:10:58,198 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-10-17 17:10:58,198 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-10-17 17:10:58,198 INFO L138 SettingsManager]: * Interval Domain=false [2022-10-17 17:10:58,198 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-10-17 17:10:58,199 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-10-17 17:10:58,199 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-10-17 17:10:58,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 17:10:58,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 17:10:58,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 17:10:58,202 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 17:10:58,202 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-17 17:10:58,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 17:10:58,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 17:10:58,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 17:10:58,203 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-17 17:10:58,203 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-17 17:10:58,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 17:10:58,204 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-17 17:10:58,204 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 17:10:58,204 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 17:10:58,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 17:10:58,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 17:10:58,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 17:10:58,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 17:10:58,206 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-10-17 17:10:58,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 17:10:58,206 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-10-17 17:10:58,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 17:10:58,207 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-10-17 17:10:58,207 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_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta/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_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta 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 -> 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf [2022-10-17 17:10:58,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 17:10:58,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 17:10:58,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 17:10:58,491 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 17:10:58,492 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 17:10:58,493 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta/../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2022-10-17 17:10:58,571 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta/data/292297871/99718ba054244883919f0523a0fda50b/FLAGbc52af280 [2022-10-17 17:10:59,172 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 17:10:59,176 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2022-10-17 17:10:59,201 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta/data/292297871/99718ba054244883919f0523a0fda50b/FLAGbc52af280 [2022-10-17 17:10:59,465 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta/data/292297871/99718ba054244883919f0523a0fda50b [2022-10-17 17:10:59,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 17:10:59,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 17:10:59,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 17:10:59,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 17:10:59,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 17:10:59,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 05:10:59" (1/1) ... [2022-10-17 17:10:59,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1200d551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:10:59, skipping insertion in model container [2022-10-17 17:10:59,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 05:10:59" (1/1) ... [2022-10-17 17:10:59,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 17:10:59,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 17:10:59,883 WARN L230 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_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2022-10-17 17:10:59,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 17:10:59,977 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 17:11:00,040 WARN L230 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_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2022-10-17 17:11:00,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 17:11:00,117 INFO L208 MainTranslator]: Completed translation [2022-10-17 17:11:00,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:11:00 WrapperNode [2022-10-17 17:11:00,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 17:11:00,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 17:11:00,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 17:11:00,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 17:11:00,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:11:00" (1/1) ... [2022-10-17 17:11:00,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:11:00" (1/1) ... [2022-10-17 17:11:00,222 INFO L138 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 294 [2022-10-17 17:11:00,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 17:11:00,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 17:11:00,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 17:11:00,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 17:11:00,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:11:00" (1/1) ... [2022-10-17 17:11:00,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:11:00" (1/1) ... [2022-10-17 17:11:00,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:11:00" (1/1) ... [2022-10-17 17:11:00,240 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:11:00" (1/1) ... [2022-10-17 17:11:00,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:11:00" (1/1) ... [2022-10-17 17:11:00,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:11:00" (1/1) ... [2022-10-17 17:11:00,265 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:11:00" (1/1) ... [2022-10-17 17:11:00,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:11:00" (1/1) ... [2022-10-17 17:11:00,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 17:11:00,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 17:11:00,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 17:11:00,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 17:11:00,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:11:00" (1/1) ... [2022-10-17 17:11:00,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 17:11:00,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta/z3 [2022-10-17 17:11:00,320 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 17:11:00,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 17:11:00,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-17 17:11:00,374 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2022-10-17 17:11:00,374 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2022-10-17 17:11:00,374 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-10-17 17:11:00,374 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-10-17 17:11:00,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 17:11:00,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-17 17:11:00,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 17:11:00,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 17:11:00,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-17 17:11:00,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-17 17:11:00,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 17:11:00,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 17:11:00,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 17:11:00,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 17:11:00,545 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 17:11:00,548 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 17:11:01,420 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 17:11:01,487 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 17:11:01,488 INFO L300 CfgBuilder]: Removed 33 assume(true) statements. [2022-10-17 17:11:01,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:11:01 BoogieIcfgContainer [2022-10-17 17:11:01,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 17:11:01,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 17:11:01,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 17:11:01,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 17:11:01,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 05:10:59" (1/3) ... [2022-10-17 17:11:01,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197e429a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 05:11:01, skipping insertion in model container [2022-10-17 17:11:01,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:11:00" (2/3) ... [2022-10-17 17:11:01,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197e429a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 05:11:01, skipping insertion in model container [2022-10-17 17:11:01,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:11:01" (3/3) ... [2022-10-17 17:11:01,514 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2022-10-17 17:11:01,534 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 17:11:01,535 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 105 error locations. [2022-10-17 17:11:01,604 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 17:11:01,611 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;@5d70c976, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 17:11:01,612 INFO L358 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2022-10-17 17:11:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 230 states, 107 states have (on average 2.514018691588785) internal successors, (269), 227 states have internal predecessors, (269), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-10-17 17:11:01,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-17 17:11:01,624 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:01,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-17 17:11:01,626 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:01,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:01,632 INFO L85 PathProgramCache]: Analyzing trace with hash 18345167, now seen corresponding path program 1 times [2022-10-17 17:11:01,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:01,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093053821] [2022-10-17 17:11:01,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:01,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:11:01,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:01,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093053821] [2022-10-17 17:11:01,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093053821] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:01,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:01,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 17:11:01,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003969571] [2022-10-17 17:11:01,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:01,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:11:01,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:01,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:11:01,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:11:01,914 INFO L87 Difference]: Start difference. First operand has 230 states, 107 states have (on average 2.514018691588785) internal successors, (269), 227 states have internal predecessors, (269), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:02,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:02,399 INFO L93 Difference]: Finished difference Result 396 states and 447 transitions. [2022-10-17 17:11:02,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:11:02,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-17 17:11:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:02,418 INFO L225 Difference]: With dead ends: 396 [2022-10-17 17:11:02,418 INFO L226 Difference]: Without dead ends: 394 [2022-10-17 17:11:02,420 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-10-17 17:11:02,423 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 181 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:02,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 479 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-17 17:11:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-10-17 17:11:02,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 226. [2022-10-17 17:11:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 107 states have (on average 2.1869158878504673) internal successors, (234), 223 states have internal predecessors, (234), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 251 transitions. [2022-10-17 17:11:02,502 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 251 transitions. Word has length 4 [2022-10-17 17:11:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:02,502 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 251 transitions. [2022-10-17 17:11:02,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 251 transitions. [2022-10-17 17:11:02,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-17 17:11:02,503 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:02,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-17 17:11:02,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 17:11:02,504 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:02,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:02,505 INFO L85 PathProgramCache]: Analyzing trace with hash 18345168, now seen corresponding path program 1 times [2022-10-17 17:11:02,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:02,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375269276] [2022-10-17 17:11:02,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:02,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:11:02,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:02,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375269276] [2022-10-17 17:11:02,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375269276] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:02,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:02,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 17:11:02,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019928240] [2022-10-17 17:11:02,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:02,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:11:02,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:02,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:11:02,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:11:02,697 INFO L87 Difference]: Start difference. First operand 226 states and 251 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:03,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:03,013 INFO L93 Difference]: Finished difference Result 360 states and 405 transitions. [2022-10-17 17:11:03,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:11:03,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-17 17:11:03,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:03,018 INFO L225 Difference]: With dead ends: 360 [2022-10-17 17:11:03,018 INFO L226 Difference]: Without dead ends: 360 [2022-10-17 17:11:03,018 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-10-17 17:11:03,025 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 148 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:03,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 471 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-17 17:11:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-10-17 17:11:03,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 224. [2022-10-17 17:11:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 107 states have (on average 2.1682242990654204) internal successors, (232), 221 states have internal predecessors, (232), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 249 transitions. [2022-10-17 17:11:03,065 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 249 transitions. Word has length 4 [2022-10-17 17:11:03,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:03,066 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 249 transitions. [2022-10-17 17:11:03,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:03,067 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 249 transitions. [2022-10-17 17:11:03,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-17 17:11:03,068 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:03,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-17 17:11:03,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 17:11:03,070 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:03,071 INFO L85 PathProgramCache]: Analyzing trace with hash 568154688, now seen corresponding path program 1 times [2022-10-17 17:11:03,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:03,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024662497] [2022-10-17 17:11:03,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:03,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:11:03,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:03,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024662497] [2022-10-17 17:11:03,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024662497] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:03,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:03,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-17 17:11:03,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632697900] [2022-10-17 17:11:03,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:03,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:11:03,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:03,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:11:03,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:11:03,127 INFO L87 Difference]: Start difference. First operand 224 states and 249 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:03,370 INFO L93 Difference]: Finished difference Result 349 states and 393 transitions. [2022-10-17 17:11:03,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:11:03,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-17 17:11:03,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:03,374 INFO L225 Difference]: With dead ends: 349 [2022-10-17 17:11:03,374 INFO L226 Difference]: Without dead ends: 348 [2022-10-17 17:11:03,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:11:03,383 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 125 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:03,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 311 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:11:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-10-17 17:11:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 227. [2022-10-17 17:11:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 110 states have (on average 2.1454545454545455) internal successors, (236), 224 states have internal predecessors, (236), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 253 transitions. [2022-10-17 17:11:03,413 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 253 transitions. Word has length 5 [2022-10-17 17:11:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:03,414 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 253 transitions. [2022-10-17 17:11:03,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:03,415 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 253 transitions. [2022-10-17 17:11:03,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-17 17:11:03,415 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:03,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-17 17:11:03,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 17:11:03,416 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:03,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:03,417 INFO L85 PathProgramCache]: Analyzing trace with hash 450363646, now seen corresponding path program 1 times [2022-10-17 17:11:03,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:03,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723320111] [2022-10-17 17:11:03,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:03,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:11:03,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:03,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723320111] [2022-10-17 17:11:03,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723320111] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:03,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:03,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 17:11:03,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922744261] [2022-10-17 17:11:03,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:03,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:11:03,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:03,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:11:03,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:11:03,604 INFO L87 Difference]: Start difference. First operand 227 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:03,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:03,857 INFO L93 Difference]: Finished difference Result 360 states and 404 transitions. [2022-10-17 17:11:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:11:03,858 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-17 17:11:03,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:03,861 INFO L225 Difference]: With dead ends: 360 [2022-10-17 17:11:03,861 INFO L226 Difference]: Without dead ends: 360 [2022-10-17 17:11:03,861 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-10-17 17:11:03,872 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 146 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:03,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 466 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:11:03,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-10-17 17:11:03,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 225. [2022-10-17 17:11:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 110 states have (on average 2.1272727272727274) internal successors, (234), 222 states have internal predecessors, (234), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 251 transitions. [2022-10-17 17:11:03,888 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 251 transitions. Word has length 6 [2022-10-17 17:11:03,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:03,889 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 251 transitions. [2022-10-17 17:11:03,889 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 251 transitions. [2022-10-17 17:11:03,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-17 17:11:03,890 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:03,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-17 17:11:03,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 17:11:03,891 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:03,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:03,893 INFO L85 PathProgramCache]: Analyzing trace with hash 450363645, now seen corresponding path program 1 times [2022-10-17 17:11:03,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:03,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386198502] [2022-10-17 17:11:03,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:03,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:11:03,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:03,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386198502] [2022-10-17 17:11:03,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386198502] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:03,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:03,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 17:11:03,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801303573] [2022-10-17 17:11:03,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:03,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:11:03,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:03,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:11:03,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:11:03,997 INFO L87 Difference]: Start difference. First operand 225 states and 251 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:04,239 INFO L93 Difference]: Finished difference Result 390 states and 440 transitions. [2022-10-17 17:11:04,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:11:04,240 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-17 17:11:04,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:04,243 INFO L225 Difference]: With dead ends: 390 [2022-10-17 17:11:04,243 INFO L226 Difference]: Without dead ends: 390 [2022-10-17 17:11:04,243 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-10-17 17:11:04,244 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 174 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:04,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 474 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:11:04,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-10-17 17:11:04,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 223. [2022-10-17 17:11:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 110 states have (on average 2.109090909090909) internal successors, (232), 220 states have internal predecessors, (232), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2022-10-17 17:11:04,254 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 6 [2022-10-17 17:11:04,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:04,255 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2022-10-17 17:11:04,255 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:04,255 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2022-10-17 17:11:04,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-17 17:11:04,256 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:04,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:11:04,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 17:11:04,256 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:04,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:04,257 INFO L85 PathProgramCache]: Analyzing trace with hash 535440203, now seen corresponding path program 1 times [2022-10-17 17:11:04,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:04,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819664357] [2022-10-17 17:11:04,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:04,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:11:04,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:04,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819664357] [2022-10-17 17:11:04,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819664357] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:04,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:04,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 17:11:04,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931276268] [2022-10-17 17:11:04,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:04,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:11:04,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:04,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:11:04,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:11:04,283 INFO L87 Difference]: Start difference. First operand 223 states and 249 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:04,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:04,361 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2022-10-17 17:11:04,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:11:04,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-17 17:11:04,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:04,364 INFO L225 Difference]: With dead ends: 229 [2022-10-17 17:11:04,365 INFO L226 Difference]: Without dead ends: 228 [2022-10-17 17:11:04,365 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-10-17 17:11:04,366 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 5 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:04,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 415 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:11:04,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-10-17 17:11:04,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 222. [2022-10-17 17:11:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 109 states have (on average 2.110091743119266) internal successors, (230), 219 states have internal predecessors, (230), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 247 transitions. [2022-10-17 17:11:04,373 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 247 transitions. Word has length 7 [2022-10-17 17:11:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:04,374 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 247 transitions. [2022-10-17 17:11:04,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 247 transitions. [2022-10-17 17:11:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-17 17:11:04,375 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:04,375 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:11:04,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 17:11:04,375 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:04,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:04,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1154009547, now seen corresponding path program 1 times [2022-10-17 17:11:04,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:04,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399254108] [2022-10-17 17:11:04,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:04,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:04,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:11:04,438 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:04,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399254108] [2022-10-17 17:11:04,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399254108] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:04,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:04,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 17:11:04,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987667759] [2022-10-17 17:11:04,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:04,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:11:04,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:04,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:11:04,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:11:04,440 INFO L87 Difference]: Start difference. First operand 222 states and 247 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:04,584 INFO L93 Difference]: Finished difference Result 353 states and 393 transitions. [2022-10-17 17:11:04,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 17:11:04,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-17 17:11:04,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:04,589 INFO L225 Difference]: With dead ends: 353 [2022-10-17 17:11:04,589 INFO L226 Difference]: Without dead ends: 353 [2022-10-17 17:11:04,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-17 17:11:04,590 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 535 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:04,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 380 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:11:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-10-17 17:11:04,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 222. [2022-10-17 17:11:04,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 109 states have (on average 2.1009174311926606) internal successors, (229), 219 states have internal predecessors, (229), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 246 transitions. [2022-10-17 17:11:04,601 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 246 transitions. Word has length 11 [2022-10-17 17:11:04,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:04,601 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 246 transitions. [2022-10-17 17:11:04,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:04,602 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 246 transitions. [2022-10-17 17:11:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-17 17:11:04,602 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:04,602 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:11:04,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 17:11:04,604 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:04,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:04,605 INFO L85 PathProgramCache]: Analyzing trace with hash -901980672, now seen corresponding path program 1 times [2022-10-17 17:11:04,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:04,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119667987] [2022-10-17 17:11:04,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:04,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:11:04,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:04,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119667987] [2022-10-17 17:11:04,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119667987] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:04,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:04,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 17:11:04,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263276273] [2022-10-17 17:11:04,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:04,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 17:11:04,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:04,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 17:11:04,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:11:04,711 INFO L87 Difference]: Start difference. First operand 222 states and 246 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:04,979 INFO L93 Difference]: Finished difference Result 627 states and 702 transitions. [2022-10-17 17:11:04,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 17:11:04,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-17 17:11:04,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:04,986 INFO L225 Difference]: With dead ends: 627 [2022-10-17 17:11:04,986 INFO L226 Difference]: Without dead ends: 627 [2022-10-17 17:11:04,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-17 17:11:04,988 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 1317 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:04,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 528 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:11:04,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-10-17 17:11:04,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 247. [2022-10-17 17:11:04,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 135 states have (on average 2.066666666666667) internal successors, (279), 244 states have internal predecessors, (279), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:05,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 295 transitions. [2022-10-17 17:11:05,001 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 295 transitions. Word has length 13 [2022-10-17 17:11:05,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:05,002 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 295 transitions. [2022-10-17 17:11:05,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:05,002 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 295 transitions. [2022-10-17 17:11:05,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-17 17:11:05,003 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:05,003 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:11:05,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 17:11:05,004 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:05,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:05,005 INFO L85 PathProgramCache]: Analyzing trace with hash -901991921, now seen corresponding path program 1 times [2022-10-17 17:11:05,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:05,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542740084] [2022-10-17 17:11:05,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:05,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:11:05,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:05,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542740084] [2022-10-17 17:11:05,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542740084] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:05,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:05,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 17:11:05,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37151169] [2022-10-17 17:11:05,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:05,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 17:11:05,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:05,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 17:11:05,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:11:05,115 INFO L87 Difference]: Start difference. First operand 247 states and 295 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:05,546 INFO L93 Difference]: Finished difference Result 403 states and 470 transitions. [2022-10-17 17:11:05,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 17:11:05,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-17 17:11:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:05,550 INFO L225 Difference]: With dead ends: 403 [2022-10-17 17:11:05,550 INFO L226 Difference]: Without dead ends: 403 [2022-10-17 17:11:05,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-17 17:11:05,551 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 576 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:05,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 413 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-17 17:11:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-10-17 17:11:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 238. [2022-10-17 17:11:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 135 states have (on average 1.9777777777777779) internal successors, (267), 235 states have internal predecessors, (267), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 283 transitions. [2022-10-17 17:11:05,563 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 283 transitions. Word has length 13 [2022-10-17 17:11:05,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:05,564 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 283 transitions. [2022-10-17 17:11:05,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 283 transitions. [2022-10-17 17:11:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-17 17:11:05,565 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:05,565 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:11:05,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-17 17:11:05,566 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:05,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:05,567 INFO L85 PathProgramCache]: Analyzing trace with hash -901991920, now seen corresponding path program 1 times [2022-10-17 17:11:05,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:05,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11609152] [2022-10-17 17:11:05,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:05,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:11:05,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:05,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11609152] [2022-10-17 17:11:05,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11609152] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:05,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:05,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 17:11:05,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543600855] [2022-10-17 17:11:05,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:05,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 17:11:05,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:05,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 17:11:05,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:11:05,748 INFO L87 Difference]: Start difference. First operand 238 states and 283 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:06,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:06,173 INFO L93 Difference]: Finished difference Result 534 states and 596 transitions. [2022-10-17 17:11:06,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 17:11:06,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-17 17:11:06,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:06,176 INFO L225 Difference]: With dead ends: 534 [2022-10-17 17:11:06,176 INFO L226 Difference]: Without dead ends: 534 [2022-10-17 17:11:06,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-17 17:11:06,177 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 804 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:06,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 441 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-17 17:11:06,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-10-17 17:11:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 258. [2022-10-17 17:11:06,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 155 states have (on average 1.8774193548387097) internal successors, (291), 255 states have internal predecessors, (291), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:06,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 307 transitions. [2022-10-17 17:11:06,208 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 307 transitions. Word has length 13 [2022-10-17 17:11:06,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:06,208 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 307 transitions. [2022-10-17 17:11:06,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:06,209 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 307 transitions. [2022-10-17 17:11:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-17 17:11:06,209 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:06,210 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:11:06,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-17 17:11:06,210 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:06,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:06,211 INFO L85 PathProgramCache]: Analyzing trace with hash -256693872, now seen corresponding path program 1 times [2022-10-17 17:11:06,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:06,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291593530] [2022-10-17 17:11:06,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:06,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-17 17:11:06,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:06,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291593530] [2022-10-17 17:11:06,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291593530] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:06,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:06,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 17:11:06,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630549154] [2022-10-17 17:11:06,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:06,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 17:11:06,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:06,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 17:11:06,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:11:06,328 INFO L87 Difference]: Start difference. First operand 258 states and 307 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:06,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:06,577 INFO L93 Difference]: Finished difference Result 332 states and 387 transitions. [2022-10-17 17:11:06,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 17:11:06,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-10-17 17:11:06,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:06,580 INFO L225 Difference]: With dead ends: 332 [2022-10-17 17:11:06,580 INFO L226 Difference]: Without dead ends: 332 [2022-10-17 17:11:06,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-17 17:11:06,581 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 95 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:06,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 662 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:11:06,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-10-17 17:11:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 257. [2022-10-17 17:11:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 155 states have (on average 1.864516129032258) internal successors, (289), 254 states have internal predecessors, (289), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 304 transitions. [2022-10-17 17:11:06,592 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 304 transitions. Word has length 20 [2022-10-17 17:11:06,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:06,593 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 304 transitions. [2022-10-17 17:11:06,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 304 transitions. [2022-10-17 17:11:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-17 17:11:06,594 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:06,594 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:11:06,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-17 17:11:06,595 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:06,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:06,596 INFO L85 PathProgramCache]: Analyzing trace with hash -937110950, now seen corresponding path program 1 times [2022-10-17 17:11:06,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:06,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403420547] [2022-10-17 17:11:06,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:06,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-17 17:11:06,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:06,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403420547] [2022-10-17 17:11:06,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403420547] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:06,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:06,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 17:11:06,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271598310] [2022-10-17 17:11:06,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:06,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 17:11:06,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:06,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 17:11:06,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:11:06,726 INFO L87 Difference]: Start difference. First operand 257 states and 304 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:06,924 INFO L93 Difference]: Finished difference Result 256 states and 301 transitions. [2022-10-17 17:11:06,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 17:11:06,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-10-17 17:11:06,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:06,927 INFO L225 Difference]: With dead ends: 256 [2022-10-17 17:11:06,927 INFO L226 Difference]: Without dead ends: 256 [2022-10-17 17:11:06,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-17 17:11:06,928 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 18 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:06,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 673 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:11:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-10-17 17:11:06,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-10-17 17:11:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 155 states have (on average 1.8516129032258064) internal successors, (287), 253 states have internal predecessors, (287), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 301 transitions. [2022-10-17 17:11:06,936 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 301 transitions. Word has length 20 [2022-10-17 17:11:06,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:06,936 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 301 transitions. [2022-10-17 17:11:06,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:06,937 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 301 transitions. [2022-10-17 17:11:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-17 17:11:06,937 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:06,938 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:11:06,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-17 17:11:06,938 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1946598122, now seen corresponding path program 1 times [2022-10-17 17:11:06,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:06,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534292574] [2022-10-17 17:11:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:11:07,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:07,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534292574] [2022-10-17 17:11:07,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534292574] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:07,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:07,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 17:11:07,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387306104] [2022-10-17 17:11:07,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:07,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 17:11:07,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:07,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 17:11:07,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-17 17:11:07,173 INFO L87 Difference]: Start difference. First operand 256 states and 301 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:07,578 INFO L93 Difference]: Finished difference Result 539 states and 596 transitions. [2022-10-17 17:11:07,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-17 17:11:07,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-17 17:11:07,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:07,582 INFO L225 Difference]: With dead ends: 539 [2022-10-17 17:11:07,582 INFO L226 Difference]: Without dead ends: 539 [2022-10-17 17:11:07,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-10-17 17:11:07,584 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 1165 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:07,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 825 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-17 17:11:07,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-10-17 17:11:07,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 256. [2022-10-17 17:11:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 155 states have (on average 1.8451612903225807) internal successors, (286), 253 states have internal predecessors, (286), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 300 transitions. [2022-10-17 17:11:07,596 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 300 transitions. Word has length 23 [2022-10-17 17:11:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:07,598 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 300 transitions. [2022-10-17 17:11:07,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 300 transitions. [2022-10-17 17:11:07,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-17 17:11:07,601 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:07,602 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:11:07,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-17 17:11:07,602 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:07,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:07,603 INFO L85 PathProgramCache]: Analyzing trace with hash -479719491, now seen corresponding path program 1 times [2022-10-17 17:11:07,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:07,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154105870] [2022-10-17 17:11:07,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:07,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:11:07,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:07,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154105870] [2022-10-17 17:11:07,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154105870] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:07,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:07,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 17:11:07,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619587715] [2022-10-17 17:11:07,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:07,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 17:11:07,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:07,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 17:11:07,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-17 17:11:07,885 INFO L87 Difference]: Start difference. First operand 256 states and 300 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:08,292 INFO L93 Difference]: Finished difference Result 538 states and 594 transitions. [2022-10-17 17:11:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-17 17:11:08,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-17 17:11:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:08,296 INFO L225 Difference]: With dead ends: 538 [2022-10-17 17:11:08,296 INFO L226 Difference]: Without dead ends: 538 [2022-10-17 17:11:08,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-10-17 17:11:08,297 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 1161 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:08,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 825 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-17 17:11:08,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-10-17 17:11:08,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 256. [2022-10-17 17:11:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 155 states have (on average 1.8387096774193548) internal successors, (285), 253 states have internal predecessors, (285), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 299 transitions. [2022-10-17 17:11:08,307 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 299 transitions. Word has length 23 [2022-10-17 17:11:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:08,308 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 299 transitions. [2022-10-17 17:11:08,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:08,308 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 299 transitions. [2022-10-17 17:11:08,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-17 17:11:08,312 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:08,312 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:11:08,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-17 17:11:08,313 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:08,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:08,313 INFO L85 PathProgramCache]: Analyzing trace with hash 214784498, now seen corresponding path program 1 times [2022-10-17 17:11:08,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:08,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84333503] [2022-10-17 17:11:08,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:08,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:11:08,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:08,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84333503] [2022-10-17 17:11:08,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84333503] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:08,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:08,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 17:11:08,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004771591] [2022-10-17 17:11:08,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:08,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-17 17:11:08,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:08,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-17 17:11:08,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-10-17 17:11:08,629 INFO L87 Difference]: Start difference. First operand 256 states and 299 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:09,383 INFO L93 Difference]: Finished difference Result 603 states and 674 transitions. [2022-10-17 17:11:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 17:11:09,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-17 17:11:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:09,387 INFO L225 Difference]: With dead ends: 603 [2022-10-17 17:11:09,387 INFO L226 Difference]: Without dead ends: 603 [2022-10-17 17:11:09,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-10-17 17:11:09,388 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 1468 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:09,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 642 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-17 17:11:09,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-10-17 17:11:09,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 257. [2022-10-17 17:11:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 156 states have (on average 1.8397435897435896) internal successors, (287), 254 states have internal predecessors, (287), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 301 transitions. [2022-10-17 17:11:09,398 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 301 transitions. Word has length 24 [2022-10-17 17:11:09,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:09,399 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 301 transitions. [2022-10-17 17:11:09,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:09,399 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 301 transitions. [2022-10-17 17:11:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-17 17:11:09,400 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:09,400 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:11:09,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-17 17:11:09,400 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:09,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:09,401 INFO L85 PathProgramCache]: Analyzing trace with hash 214784499, now seen corresponding path program 1 times [2022-10-17 17:11:09,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:09,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700403854] [2022-10-17 17:11:09,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:09,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:11:09,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:09,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700403854] [2022-10-17 17:11:09,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700403854] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:09,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:09,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 17:11:09,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852767034] [2022-10-17 17:11:09,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:09,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 17:11:09,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:09,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 17:11:09,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-17 17:11:09,868 INFO L87 Difference]: Start difference. First operand 257 states and 301 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:10,538 INFO L93 Difference]: Finished difference Result 596 states and 660 transitions. [2022-10-17 17:11:10,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-17 17:11:10,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-17 17:11:10,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:10,542 INFO L225 Difference]: With dead ends: 596 [2022-10-17 17:11:10,542 INFO L226 Difference]: Without dead ends: 596 [2022-10-17 17:11:10,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-10-17 17:11:10,543 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 1065 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:10,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 684 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-17 17:11:10,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-10-17 17:11:10,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 257. [2022-10-17 17:11:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 156 states have (on average 1.8333333333333333) internal successors, (286), 254 states have internal predecessors, (286), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 300 transitions. [2022-10-17 17:11:10,553 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 300 transitions. Word has length 24 [2022-10-17 17:11:10,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:10,554 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 300 transitions. [2022-10-17 17:11:10,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 300 transitions. [2022-10-17 17:11:10,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-17 17:11:10,555 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:10,555 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:11:10,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-17 17:11:10,555 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:10,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:10,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1986692204, now seen corresponding path program 1 times [2022-10-17 17:11:10,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:10,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136916598] [2022-10-17 17:11:10,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:10,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:11:10,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:10,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136916598] [2022-10-17 17:11:10,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136916598] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:10,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:10,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 17:11:10,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148837939] [2022-10-17 17:11:10,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:10,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-17 17:11:10,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:10,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-17 17:11:10,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-10-17 17:11:10,850 INFO L87 Difference]: Start difference. First operand 257 states and 300 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:11,645 INFO L93 Difference]: Finished difference Result 601 states and 672 transitions. [2022-10-17 17:11:11,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 17:11:11,645 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-17 17:11:11,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:11,649 INFO L225 Difference]: With dead ends: 601 [2022-10-17 17:11:11,649 INFO L226 Difference]: Without dead ends: 601 [2022-10-17 17:11:11,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-10-17 17:11:11,650 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 1313 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:11,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 785 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-17 17:11:11,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-10-17 17:11:11,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 257. [2022-10-17 17:11:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 156 states have (on average 1.8269230769230769) internal successors, (285), 254 states have internal predecessors, (285), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 299 transitions. [2022-10-17 17:11:11,660 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 299 transitions. Word has length 24 [2022-10-17 17:11:11,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:11,660 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 299 transitions. [2022-10-17 17:11:11,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:11,661 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 299 transitions. [2022-10-17 17:11:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-17 17:11:11,662 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:11,663 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:11:11,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-17 17:11:11,667 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:11,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:11,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1986692203, now seen corresponding path program 1 times [2022-10-17 17:11:11,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:11,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021803417] [2022-10-17 17:11:11,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:11,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:11:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:11:12,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:11:12,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021803417] [2022-10-17 17:11:12,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021803417] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:11:12,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:11:12,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 17:11:12,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279119174] [2022-10-17 17:11:12,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:11:12,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-17 17:11:12,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:11:12,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-17 17:11:12,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-10-17 17:11:12,105 INFO L87 Difference]: Start difference. First operand 257 states and 299 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:13,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:11:13,292 INFO L93 Difference]: Finished difference Result 708 states and 787 transitions. [2022-10-17 17:11:13,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-17 17:11:13,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-17 17:11:13,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:11:13,298 INFO L225 Difference]: With dead ends: 708 [2022-10-17 17:11:13,299 INFO L226 Difference]: Without dead ends: 708 [2022-10-17 17:11:13,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2022-10-17 17:11:13,300 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 1469 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-17 17:11:13,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 670 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-17 17:11:13,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-10-17 17:11:13,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 257. [2022-10-17 17:11:13,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 156 states have (on average 1.8205128205128205) internal successors, (284), 254 states have internal predecessors, (284), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-17 17:11:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 298 transitions. [2022-10-17 17:11:13,311 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 298 transitions. Word has length 24 [2022-10-17 17:11:13,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:11:13,311 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 298 transitions. [2022-10-17 17:11:13,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:11:13,312 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 298 transitions. [2022-10-17 17:11:13,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-17 17:11:13,312 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:11:13,312 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-17 17:11:13,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-17 17:11:13,313 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-10-17 17:11:13,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:11:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash -856061257, now seen corresponding path program 1 times [2022-10-17 17:11:13,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:11:13,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763418375] [2022-10-17 17:11:13,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:11:13,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:11:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 17:11:13,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 17:11:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 17:11:13,401 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-10-17 17:11:13,402 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 17:11:13,404 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (104 of 105 remaining) [2022-10-17 17:11:13,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 105 remaining) [2022-10-17 17:11:13,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 105 remaining) [2022-10-17 17:11:13,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 105 remaining) [2022-10-17 17:11:13,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 105 remaining) [2022-10-17 17:11:13,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 105 remaining) [2022-10-17 17:11:13,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 105 remaining) [2022-10-17 17:11:13,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 105 remaining) [2022-10-17 17:11:13,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 105 remaining) [2022-10-17 17:11:13,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 105 remaining) [2022-10-17 17:11:13,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 105 remaining) [2022-10-17 17:11:13,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 105 remaining) [2022-10-17 17:11:13,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 105 remaining) [2022-10-17 17:11:13,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 105 remaining) [2022-10-17 17:11:13,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 105 remaining) [2022-10-17 17:11:13,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 105 remaining) [2022-10-17 17:11:13,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 105 remaining) [2022-10-17 17:11:13,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 105 remaining) [2022-10-17 17:11:13,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 105 remaining) [2022-10-17 17:11:13,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 105 remaining) [2022-10-17 17:11:13,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 105 remaining) [2022-10-17 17:11:13,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 105 remaining) [2022-10-17 17:11:13,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 105 remaining) [2022-10-17 17:11:13,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 105 remaining) [2022-10-17 17:11:13,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 105 remaining) [2022-10-17 17:11:13,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 105 remaining) [2022-10-17 17:11:13,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 105 remaining) [2022-10-17 17:11:13,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 105 remaining) [2022-10-17 17:11:13,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 105 remaining) [2022-10-17 17:11:13,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 105 remaining) [2022-10-17 17:11:13,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 105 remaining) [2022-10-17 17:11:13,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 105 remaining) [2022-10-17 17:11:13,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 105 remaining) [2022-10-17 17:11:13,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 105 remaining) [2022-10-17 17:11:13,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 105 remaining) [2022-10-17 17:11:13,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 105 remaining) [2022-10-17 17:11:13,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 105 remaining) [2022-10-17 17:11:13,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 105 remaining) [2022-10-17 17:11:13,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 105 remaining) [2022-10-17 17:11:13,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 105 remaining) [2022-10-17 17:11:13,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 105 remaining) [2022-10-17 17:11:13,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 105 remaining) [2022-10-17 17:11:13,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 105 remaining) [2022-10-17 17:11:13,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 105 remaining) [2022-10-17 17:11:13,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 105 remaining) [2022-10-17 17:11:13,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 105 remaining) [2022-10-17 17:11:13,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 105 remaining) [2022-10-17 17:11:13,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 105 remaining) [2022-10-17 17:11:13,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 105 remaining) [2022-10-17 17:11:13,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 105 remaining) [2022-10-17 17:11:13,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 105 remaining) [2022-10-17 17:11:13,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 105 remaining) [2022-10-17 17:11:13,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 105 remaining) [2022-10-17 17:11:13,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 105 remaining) [2022-10-17 17:11:13,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 105 remaining) [2022-10-17 17:11:13,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 105 remaining) [2022-10-17 17:11:13,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 105 remaining) [2022-10-17 17:11:13,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 105 remaining) [2022-10-17 17:11:13,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 105 remaining) [2022-10-17 17:11:13,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 105 remaining) [2022-10-17 17:11:13,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 105 remaining) [2022-10-17 17:11:13,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 105 remaining) [2022-10-17 17:11:13,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 105 remaining) [2022-10-17 17:11:13,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 105 remaining) [2022-10-17 17:11:13,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 105 remaining) [2022-10-17 17:11:13,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 105 remaining) [2022-10-17 17:11:13,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 105 remaining) [2022-10-17 17:11:13,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 105 remaining) [2022-10-17 17:11:13,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 105 remaining) [2022-10-17 17:11:13,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 105 remaining) [2022-10-17 17:11:13,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 105 remaining) [2022-10-17 17:11:13,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 105 remaining) [2022-10-17 17:11:13,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 105 remaining) [2022-10-17 17:11:13,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 105 remaining) [2022-10-17 17:11:13,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 105 remaining) [2022-10-17 17:11:13,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 105 remaining) [2022-10-17 17:11:13,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 105 remaining) [2022-10-17 17:11:13,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 105 remaining) [2022-10-17 17:11:13,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 105 remaining) [2022-10-17 17:11:13,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (25 of 105 remaining) [2022-10-17 17:11:13,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE (24 of 105 remaining) [2022-10-17 17:11:13,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE (23 of 105 remaining) [2022-10-17 17:11:13,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 105 remaining) [2022-10-17 17:11:13,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 105 remaining) [2022-10-17 17:11:13,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 105 remaining) [2022-10-17 17:11:13,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 105 remaining) [2022-10-17 17:11:13,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 105 remaining) [2022-10-17 17:11:13,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 105 remaining) [2022-10-17 17:11:13,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 105 remaining) [2022-10-17 17:11:13,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 105 remaining) [2022-10-17 17:11:13,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 105 remaining) [2022-10-17 17:11:13,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 105 remaining) [2022-10-17 17:11:13,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 105 remaining) [2022-10-17 17:11:13,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 105 remaining) [2022-10-17 17:11:13,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 105 remaining) [2022-10-17 17:11:13,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 105 remaining) [2022-10-17 17:11:13,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE (8 of 105 remaining) [2022-10-17 17:11:13,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE (7 of 105 remaining) [2022-10-17 17:11:13,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE (6 of 105 remaining) [2022-10-17 17:11:13,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 105 remaining) [2022-10-17 17:11:13,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 105 remaining) [2022-10-17 17:11:13,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONMEMORY_FREE (3 of 105 remaining) [2022-10-17 17:11:13,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_FREE (2 of 105 remaining) [2022-10-17 17:11:13,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE (1 of 105 remaining) [2022-10-17 17:11:13,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK (0 of 105 remaining) [2022-10-17 17:11:13,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-17 17:11:13,447 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:11:13,453 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 17:11:13,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 05:11:13 BoogieIcfgContainer [2022-10-17 17:11:13,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 17:11:13,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 17:11:13,511 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 17:11:13,511 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 17:11:13,512 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:11:01" (3/4) ... [2022-10-17 17:11:13,514 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 17:11:13,593 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta/witness.graphml [2022-10-17 17:11:13,593 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 17:11:13,594 INFO L158 Benchmark]: Toolchain (without parser) took 14122.51ms. Allocated memory was 88.1MB in the beginning and 234.9MB in the end (delta: 146.8MB). Free memory was 61.7MB in the beginning and 177.9MB in the end (delta: -116.2MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2022-10-17 17:11:13,595 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 88.1MB. Free memory was 57.8MB in the beginning and 57.8MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 17:11:13,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 646.08ms. Allocated memory is still 88.1MB. Free memory was 61.6MB in the beginning and 54.1MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-10-17 17:11:13,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.82ms. Allocated memory is still 88.1MB. Free memory was 54.1MB in the beginning and 51.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 17:11:13,597 INFO L158 Benchmark]: Boogie Preprocessor took 49.04ms. Allocated memory is still 88.1MB. Free memory was 51.4MB in the beginning and 48.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 17:11:13,598 INFO L158 Benchmark]: RCFGBuilder took 1230.09ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 48.6MB in the beginning and 91.0MB in the end (delta: -42.4MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2022-10-17 17:11:13,598 INFO L158 Benchmark]: TraceAbstraction took 12004.28ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 91.0MB in the beginning and 180.0MB in the end (delta: -89.0MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2022-10-17 17:11:13,604 INFO L158 Benchmark]: Witness Printer took 82.26ms. Allocated memory is still 234.9MB. Free memory was 180.0MB in the beginning and 177.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 17:11:13,608 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 88.1MB. Free memory was 57.8MB in the beginning and 57.8MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 646.08ms. Allocated memory is still 88.1MB. Free memory was 61.6MB in the beginning and 54.1MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.82ms. Allocated memory is still 88.1MB. Free memory was 54.1MB in the beginning and 51.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.04ms. Allocated memory is still 88.1MB. Free memory was 51.4MB in the beginning and 48.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1230.09ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 48.6MB in the beginning and 91.0MB in the end (delta: -42.4MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12004.28ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 91.0MB in the beginning and 180.0MB in the end (delta: -89.0MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Witness Printer took 82.26ms. Allocated memory is still 234.9MB. Free memory was 180.0MB in the beginning and 177.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L638] struct list *data = ((void *)0); VAL [data={0:0}] [L639] COND TRUE __VERIFIER_nondet_int() [L640] struct node *node = malloc(sizeof *node); [L641] COND FALSE !(!node) VAL [data={0:0}, node={-1:0}] [L643] node->next = node [L644] node->value = __VERIFIER_nondet_int() [L645] struct list *item = malloc(sizeof *item); [L646] COND FALSE !(!item) VAL [data={0:0}, item={-3:0}, node={-1:0}] [L648] item->slist = node VAL [data={0:0}, item={-3:0}, node={-1:0}] [L649] item->next = data [L650] data = item VAL [data={-3:0}, item={-3:0}, node={-1:0}] [L639] COND FALSE !(__VERIFIER_nondet_int()) [L652] COND FALSE !(!data) [L654] CALL inspect_before(data) [L615] COND FALSE !(!(shape)) VAL [shape={-3:0}, shape={-3:0}] [L616] shape->next VAL [shape={-3:0}, shape={-3:0}, shape->next={0:0}] [L616] COND FALSE !(shape->next) [L622] COND FALSE !(!(shape)) VAL [shape={-3:0}, shape={-3:0}] [L623] EXPR shape->next VAL [shape={-3:0}, shape={-3:0}, shape->next={0:0}] [L623] COND FALSE !(!(shape->next == ((void *)0))) [L624] EXPR shape->slist VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}] [L624] COND FALSE !(!(shape->slist)) [L625] EXPR shape->slist VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}] [L625] EXPR shape->slist->next VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}, shape->slist->next={-1:0}] [L625] COND TRUE !(shape->slist->next == ((void *)0)) [L625] CALL fail() [L565] reach_error() - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 230 locations, 105 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11783 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11765 mSDsluCounter, 10144 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6898 mSDsCounter, 277 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6384 IncrementalHoareTripleChecker+Invalid, 6661 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 277 mSolverCounterUnsat, 3652 mSDtfsCounter, 6384 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=10, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 3805 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 1833 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 24/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-10-17 17:11:13,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8c52f2d-daae-4da7-b6c9-a4cb9d757f83/bin/utaipan-G1rejxKTta/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)