./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 20:34:58,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 20:34:58,695 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-23 20:34:58,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 20:34:58,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 20:34:58,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 20:34:58,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 20:34:58,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 20:34:58,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 20:34:58,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 20:34:58,732 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 20:34:58,733 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 20:34:58,734 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 20:34:58,734 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 20:34:58,735 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 20:34:58,735 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 20:34:58,736 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 20:34:58,736 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 20:34:58,737 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 20:34:58,737 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 20:34:58,738 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 20:34:58,738 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 20:34:58,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 20:34:58,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 20:34:58,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 20:34:58,741 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 20:34:58,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 20:34:58,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 20:34:58,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 20:34:58,742 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 20:34:58,743 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 20:34:58,743 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 20:34:58,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 20:34:58,744 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 20:34:58,744 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 20:34:58,745 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 20:34:58,745 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 20:34:58,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 20:34:58,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 20:34:58,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 20:34:58,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:34:58,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 20:34:58,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 20:34:58,748 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 20:34:58,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 20:34:58,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 20:34:58,750 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 20:34:58,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 20:34:58,750 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/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_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 [2023-11-23 20:34:59,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 20:34:59,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 20:34:59,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 20:34:59,043 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 20:34:59,043 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 20:34:59,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2023-11-23 20:35:02,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 20:35:02,461 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 20:35:02,465 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2023-11-23 20:35:02,490 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/data/cfbfc324b/2fbd04433999403aa5daf075044e825b/FLAGf5e5ceea3 [2023-11-23 20:35:02,508 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/data/cfbfc324b/2fbd04433999403aa5daf075044e825b [2023-11-23 20:35:02,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 20:35:02,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 20:35:02,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 20:35:02,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 20:35:02,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 20:35:02,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:35:02" (1/1) ... [2023-11-23 20:35:02,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65fd02c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:02, skipping insertion in model container [2023-11-23 20:35:02,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:35:02" (1/1) ... [2023-11-23 20:35:02,583 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 20:35:02,928 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:35:02,943 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 20:35:03,024 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:35:03,059 WARN L675 CHandler]: The function insert_fnc is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 20:35:03,066 INFO L206 MainTranslator]: Completed translation [2023-11-23 20:35:03,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:03 WrapperNode [2023-11-23 20:35:03,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 20:35:03,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 20:35:03,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 20:35:03,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 20:35:03,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:03" (1/1) ... [2023-11-23 20:35:03,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:03" (1/1) ... [2023-11-23 20:35:03,165 INFO L138 Inliner]: procedures = 140, calls = 95, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 242 [2023-11-23 20:35:03,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 20:35:03,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 20:35:03,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 20:35:03,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 20:35:03,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:03" (1/1) ... [2023-11-23 20:35:03,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:03" (1/1) ... [2023-11-23 20:35:03,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:03" (1/1) ... [2023-11-23 20:35:03,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:03" (1/1) ... [2023-11-23 20:35:03,204 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:03" (1/1) ... [2023-11-23 20:35:03,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:03" (1/1) ... [2023-11-23 20:35:03,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:03" (1/1) ... [2023-11-23 20:35:03,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:03" (1/1) ... [2023-11-23 20:35:03,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 20:35:03,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 20:35:03,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 20:35:03,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 20:35:03,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:03" (1/1) ... [2023-11-23 20:35:03,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:35:03,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:35:03,278 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 20:35:03,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 20:35:03,314 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-11-23 20:35:03,315 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-11-23 20:35:03,315 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2023-11-23 20:35:03,315 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2023-11-23 20:35:03,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 20:35:03,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 20:35:03,316 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2023-11-23 20:35:03,316 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2023-11-23 20:35:03,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 20:35:03,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 20:35:03,317 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-11-23 20:35:03,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-11-23 20:35:03,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 20:35:03,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 20:35:03,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 20:35:03,318 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2023-11-23 20:35:03,318 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2023-11-23 20:35:03,318 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2023-11-23 20:35:03,318 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2023-11-23 20:35:03,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 20:35:03,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 20:35:03,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 20:35:03,465 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 20:35:03,467 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 20:35:04,236 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 20:35:04,355 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 20:35:04,358 INFO L309 CfgBuilder]: Removed 38 assume(true) statements. [2023-11-23 20:35:04,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:35:04 BoogieIcfgContainer [2023-11-23 20:35:04,360 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 20:35:04,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 20:35:04,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 20:35:04,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 20:35:04,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:35:02" (1/3) ... [2023-11-23 20:35:04,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61939698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:35:04, skipping insertion in model container [2023-11-23 20:35:04,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:03" (2/3) ... [2023-11-23 20:35:04,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61939698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:35:04, skipping insertion in model container [2023-11-23 20:35:04,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:35:04" (3/3) ... [2023-11-23 20:35:04,377 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-1.i [2023-11-23 20:35:04,396 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 20:35:04,397 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2023-11-23 20:35:04,467 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 20:35:04,475 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;@1808bce5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 20:35:04,476 INFO L358 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2023-11-23 20:35:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 106 states have (on average 2.4622641509433962) internal successors, (261), 223 states have internal predecessors, (261), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-23 20:35:04,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-23 20:35:04,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:04,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:04,489 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:04,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:04,495 INFO L85 PathProgramCache]: Analyzing trace with hash 946226634, now seen corresponding path program 1 times [2023-11-23 20:35:04,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:04,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550004871] [2023-11-23 20:35:04,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:04,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:04,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:04,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550004871] [2023-11-23 20:35:04,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550004871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:04,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:04,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:35:04,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406653106] [2023-11-23 20:35:04,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:04,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:35:04,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:04,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:35:04,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:35:04,948 INFO L87 Difference]: Start difference. First operand has 235 states, 106 states have (on average 2.4622641509433962) internal successors, (261), 223 states have internal predecessors, (261), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:05,203 INFO L93 Difference]: Finished difference Result 231 states and 261 transitions. [2023-11-23 20:35:05,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:35:05,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-23 20:35:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:05,221 INFO L225 Difference]: With dead ends: 231 [2023-11-23 20:35:05,221 INFO L226 Difference]: Without dead ends: 230 [2023-11-23 20:35:05,223 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 [2023-11-23 20:35:05,228 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 3 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:05,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 372 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:35:05,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-23 20:35:05,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2023-11-23 20:35:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 105 states have (on average 2.1523809523809523) internal successors, (226), 218 states have internal predecessors, (226), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-23 20:35:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 260 transitions. [2023-11-23 20:35:05,317 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 260 transitions. Word has length 7 [2023-11-23 20:35:05,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:05,318 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 260 transitions. [2023-11-23 20:35:05,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 260 transitions. [2023-11-23 20:35:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-23 20:35:05,319 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:05,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:05,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 20:35:05,320 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:05,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:05,321 INFO L85 PathProgramCache]: Analyzing trace with hash 946226635, now seen corresponding path program 1 times [2023-11-23 20:35:05,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:05,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405663480] [2023-11-23 20:35:05,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:05,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:05,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:05,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405663480] [2023-11-23 20:35:05,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405663480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:05,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:05,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 20:35:05,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062836668] [2023-11-23 20:35:05,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:05,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 20:35:05,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:05,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 20:35:05,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:35:05,591 INFO L87 Difference]: Start difference. First operand 230 states and 260 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:05,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:05,835 INFO L93 Difference]: Finished difference Result 252 states and 290 transitions. [2023-11-23 20:35:05,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:35:05,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-23 20:35:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:05,840 INFO L225 Difference]: With dead ends: 252 [2023-11-23 20:35:05,841 INFO L226 Difference]: Without dead ends: 252 [2023-11-23 20:35:05,845 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 [2023-11-23 20:35:05,848 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 15 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:05,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 909 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:35:05,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-11-23 20:35:05,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2023-11-23 20:35:05,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 114 states have (on average 2.0964912280701755) internal successors, (239), 227 states have internal predecessors, (239), 29 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2023-11-23 20:35:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 286 transitions. [2023-11-23 20:35:05,889 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 286 transitions. Word has length 7 [2023-11-23 20:35:05,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:05,890 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 286 transitions. [2023-11-23 20:35:05,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:05,890 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 286 transitions. [2023-11-23 20:35:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 20:35:05,891 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:05,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:05,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 20:35:05,892 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:05,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:05,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1226571017, now seen corresponding path program 1 times [2023-11-23 20:35:05,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:05,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564442319] [2023-11-23 20:35:05,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:05,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:05,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:05,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564442319] [2023-11-23 20:35:05,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564442319] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:05,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:05,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:35:05,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400877980] [2023-11-23 20:35:05,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:05,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:35:05,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:05,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:35:05,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:35:05,991 INFO L87 Difference]: Start difference. First operand 246 states and 286 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:06,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:06,166 INFO L93 Difference]: Finished difference Result 243 states and 283 transitions. [2023-11-23 20:35:06,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:35:06,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-23 20:35:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:06,168 INFO L225 Difference]: With dead ends: 243 [2023-11-23 20:35:06,168 INFO L226 Difference]: Without dead ends: 243 [2023-11-23 20:35:06,169 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 [2023-11-23 20:35:06,176 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 5 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:06,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 366 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:35:06,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-11-23 20:35:06,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2023-11-23 20:35:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 114 states have (on average 2.0701754385964914) internal successors, (236), 224 states have internal predecessors, (236), 29 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2023-11-23 20:35:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 283 transitions. [2023-11-23 20:35:06,195 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 283 transitions. Word has length 9 [2023-11-23 20:35:06,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:06,195 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 283 transitions. [2023-11-23 20:35:06,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:06,196 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 283 transitions. [2023-11-23 20:35:06,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 20:35:06,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:06,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:06,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 20:35:06,197 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:06,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:06,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1226571016, now seen corresponding path program 1 times [2023-11-23 20:35:06,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:06,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681949741] [2023-11-23 20:35:06,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:06,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:06,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:06,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:06,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681949741] [2023-11-23 20:35:06,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681949741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:06,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:06,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:35:06,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874998749] [2023-11-23 20:35:06,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:06,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:35:06,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:06,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:35:06,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:35:06,277 INFO L87 Difference]: Start difference. First operand 243 states and 283 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:06,441 INFO L93 Difference]: Finished difference Result 240 states and 280 transitions. [2023-11-23 20:35:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:35:06,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-23 20:35:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:06,444 INFO L225 Difference]: With dead ends: 240 [2023-11-23 20:35:06,444 INFO L226 Difference]: Without dead ends: 240 [2023-11-23 20:35:06,444 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 [2023-11-23 20:35:06,445 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 2 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:06,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 369 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:35:06,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-11-23 20:35:06,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2023-11-23 20:35:06,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 114 states have (on average 2.043859649122807) internal successors, (233), 221 states have internal predecessors, (233), 29 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2023-11-23 20:35:06,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 280 transitions. [2023-11-23 20:35:06,455 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 280 transitions. Word has length 9 [2023-11-23 20:35:06,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:06,456 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 280 transitions. [2023-11-23 20:35:06,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2023-11-23 20:35:06,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-23 20:35:06,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:06,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:06,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 20:35:06,457 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting dll_insert_masterErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:06,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:06,458 INFO L85 PathProgramCache]: Analyzing trace with hash 804589796, now seen corresponding path program 1 times [2023-11-23 20:35:06,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:06,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669195959] [2023-11-23 20:35:06,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:06,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:06,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:06,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669195959] [2023-11-23 20:35:06,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669195959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:06,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:06,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 20:35:06,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649504649] [2023-11-23 20:35:06,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:06,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 20:35:06,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:06,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 20:35:06,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 20:35:06,693 INFO L87 Difference]: Start difference. First operand 240 states and 280 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:07,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:07,205 INFO L93 Difference]: Finished difference Result 259 states and 302 transitions. [2023-11-23 20:35:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 20:35:07,206 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-23 20:35:07,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:07,208 INFO L225 Difference]: With dead ends: 259 [2023-11-23 20:35:07,208 INFO L226 Difference]: Without dead ends: 259 [2023-11-23 20:35:07,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-23 20:35:07,210 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 75 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:07,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1000 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 20:35:07,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-11-23 20:35:07,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 249. [2023-11-23 20:35:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 122 states have (on average 1.9918032786885247) internal successors, (243), 228 states have internal predecessors, (243), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2023-11-23 20:35:07,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 292 transitions. [2023-11-23 20:35:07,220 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 292 transitions. Word has length 12 [2023-11-23 20:35:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:07,221 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 292 transitions. [2023-11-23 20:35:07,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:07,221 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 292 transitions. [2023-11-23 20:35:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-23 20:35:07,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:07,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:07,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 20:35:07,222 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting dll_insert_masterErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:07,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:07,223 INFO L85 PathProgramCache]: Analyzing trace with hash 804589797, now seen corresponding path program 1 times [2023-11-23 20:35:07,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:07,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763523872] [2023-11-23 20:35:07,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:07,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:07,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:07,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763523872] [2023-11-23 20:35:07,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763523872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:07,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:07,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 20:35:07,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123624044] [2023-11-23 20:35:07,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:07,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 20:35:07,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:07,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 20:35:07,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 20:35:07,508 INFO L87 Difference]: Start difference. First operand 249 states and 292 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:08,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:08,224 INFO L93 Difference]: Finished difference Result 257 states and 300 transitions. [2023-11-23 20:35:08,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 20:35:08,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-23 20:35:08,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:08,227 INFO L225 Difference]: With dead ends: 257 [2023-11-23 20:35:08,227 INFO L226 Difference]: Without dead ends: 257 [2023-11-23 20:35:08,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-23 20:35:08,228 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 64 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:08,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 720 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 20:35:08,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-11-23 20:35:08,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 249. [2023-11-23 20:35:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 122 states have (on average 1.9754098360655739) internal successors, (241), 228 states have internal predecessors, (241), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2023-11-23 20:35:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 290 transitions. [2023-11-23 20:35:08,239 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 290 transitions. Word has length 12 [2023-11-23 20:35:08,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:08,239 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 290 transitions. [2023-11-23 20:35:08,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:08,240 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 290 transitions. [2023-11-23 20:35:08,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-23 20:35:08,240 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:08,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:08,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 20:35:08,241 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting dll_insert_masterErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:08,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:08,242 INFO L85 PathProgramCache]: Analyzing trace with hash -827500667, now seen corresponding path program 1 times [2023-11-23 20:35:08,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:08,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556286362] [2023-11-23 20:35:08,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:08,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:08,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:08,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:08,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556286362] [2023-11-23 20:35:08,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556286362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:08,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:08,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 20:35:08,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446449815] [2023-11-23 20:35:08,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:08,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:35:08,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:08,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:35:08,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:35:08,305 INFO L87 Difference]: Start difference. First operand 249 states and 290 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:08,537 INFO L93 Difference]: Finished difference Result 248 states and 289 transitions. [2023-11-23 20:35:08,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:35:08,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-23 20:35:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:08,539 INFO L225 Difference]: With dead ends: 248 [2023-11-23 20:35:08,540 INFO L226 Difference]: Without dead ends: 248 [2023-11-23 20:35:08,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:35:08,541 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 12 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:08,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 495 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:35:08,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-23 20:35:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2023-11-23 20:35:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 122 states have (on average 1.9672131147540983) internal successors, (240), 227 states have internal predecessors, (240), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2023-11-23 20:35:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 289 transitions. [2023-11-23 20:35:08,550 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 289 transitions. Word has length 13 [2023-11-23 20:35:08,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:08,550 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 289 transitions. [2023-11-23 20:35:08,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 289 transitions. [2023-11-23 20:35:08,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-23 20:35:08,551 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:08,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:08,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 20:35:08,552 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting dll_insert_masterErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:08,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:08,553 INFO L85 PathProgramCache]: Analyzing trace with hash -827500666, now seen corresponding path program 1 times [2023-11-23 20:35:08,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:08,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90384010] [2023-11-23 20:35:08,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:08,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:08,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:08,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90384010] [2023-11-23 20:35:08,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90384010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:08,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:08,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 20:35:08,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118916666] [2023-11-23 20:35:08,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:08,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:35:08,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:08,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:35:08,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:35:08,657 INFO L87 Difference]: Start difference. First operand 248 states and 289 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:08,868 INFO L93 Difference]: Finished difference Result 247 states and 288 transitions. [2023-11-23 20:35:08,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:35:08,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-23 20:35:08,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:08,871 INFO L225 Difference]: With dead ends: 247 [2023-11-23 20:35:08,872 INFO L226 Difference]: Without dead ends: 247 [2023-11-23 20:35:08,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:35:08,874 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 8 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:08,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 566 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:35:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-11-23 20:35:08,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2023-11-23 20:35:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 122 states have (on average 1.959016393442623) internal successors, (239), 226 states have internal predecessors, (239), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2023-11-23 20:35:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 288 transitions. [2023-11-23 20:35:08,897 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 288 transitions. Word has length 13 [2023-11-23 20:35:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:08,897 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 288 transitions. [2023-11-23 20:35:08,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 288 transitions. [2023-11-23 20:35:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 20:35:08,898 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:08,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:08,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 20:35:08,900 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:08,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:08,901 INFO L85 PathProgramCache]: Analyzing trace with hash -659191194, now seen corresponding path program 1 times [2023-11-23 20:35:08,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:08,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755512510] [2023-11-23 20:35:08,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:08,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:09,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:09,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755512510] [2023-11-23 20:35:09,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755512510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:09,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:09,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 20:35:09,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141581028] [2023-11-23 20:35:09,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:09,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 20:35:09,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:09,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 20:35:09,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-23 20:35:09,478 INFO L87 Difference]: Start difference. First operand 247 states and 288 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:10,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:10,145 INFO L93 Difference]: Finished difference Result 276 states and 322 transitions. [2023-11-23 20:35:10,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 20:35:10,146 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-23 20:35:10,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:10,148 INFO L225 Difference]: With dead ends: 276 [2023-11-23 20:35:10,148 INFO L226 Difference]: Without dead ends: 276 [2023-11-23 20:35:10,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-11-23 20:35:10,149 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 27 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:10,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1354 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 20:35:10,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-11-23 20:35:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 261. [2023-11-23 20:35:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 133 states have (on average 1.9172932330827068) internal successors, (255), 237 states have internal predecessors, (255), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2023-11-23 20:35:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 310 transitions. [2023-11-23 20:35:10,160 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 310 transitions. Word has length 15 [2023-11-23 20:35:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:10,161 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 310 transitions. [2023-11-23 20:35:10,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 310 transitions. [2023-11-23 20:35:10,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-23 20:35:10,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:10,162 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:10,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 20:35:10,163 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:10,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:10,164 INFO L85 PathProgramCache]: Analyzing trace with hash 504380893, now seen corresponding path program 1 times [2023-11-23 20:35:10,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:10,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220648856] [2023-11-23 20:35:10,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:10,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 20:35:10,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:10,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220648856] [2023-11-23 20:35:10,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220648856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:10,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:10,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:35:10,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375865318] [2023-11-23 20:35:10,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:10,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:35:10,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:10,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:35:10,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:35:10,277 INFO L87 Difference]: Start difference. First operand 261 states and 310 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:10,431 INFO L93 Difference]: Finished difference Result 259 states and 308 transitions. [2023-11-23 20:35:10,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:35:10,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-23 20:35:10,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:10,434 INFO L225 Difference]: With dead ends: 259 [2023-11-23 20:35:10,434 INFO L226 Difference]: Without dead ends: 259 [2023-11-23 20:35:10,434 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 [2023-11-23 20:35:10,435 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 1 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:10,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 365 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:10,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-11-23 20:35:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2023-11-23 20:35:10,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 133 states have (on average 1.9022556390977443) internal successors, (253), 235 states have internal predecessors, (253), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2023-11-23 20:35:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 308 transitions. [2023-11-23 20:35:10,449 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 308 transitions. Word has length 21 [2023-11-23 20:35:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:10,449 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 308 transitions. [2023-11-23 20:35:10,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 308 transitions. [2023-11-23 20:35:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 20:35:10,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:10,450 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:10,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 20:35:10,451 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~VOIDErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:10,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:10,451 INFO L85 PathProgramCache]: Analyzing trace with hash -621247758, now seen corresponding path program 1 times [2023-11-23 20:35:10,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:10,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222840069] [2023-11-23 20:35:10,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:10,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:10,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 20:35:10,677 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:10,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222840069] [2023-11-23 20:35:10,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222840069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:10,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:10,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 20:35:10,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392190153] [2023-11-23 20:35:10,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:10,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 20:35:10,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:10,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 20:35:10,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 20:35:10,679 INFO L87 Difference]: Start difference. First operand 259 states and 308 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:11,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:11,104 INFO L93 Difference]: Finished difference Result 257 states and 306 transitions. [2023-11-23 20:35:11,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:35:11,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-23 20:35:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:11,106 INFO L225 Difference]: With dead ends: 257 [2023-11-23 20:35:11,107 INFO L226 Difference]: Without dead ends: 257 [2023-11-23 20:35:11,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-23 20:35:11,107 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 47 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:11,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 868 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 20:35:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-11-23 20:35:11,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2023-11-23 20:35:11,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 133 states have (on average 1.887218045112782) internal successors, (251), 233 states have internal predecessors, (251), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2023-11-23 20:35:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2023-11-23 20:35:11,117 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 23 [2023-11-23 20:35:11,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:11,118 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2023-11-23 20:35:11,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2023-11-23 20:35:11,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 20:35:11,119 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:11,119 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:11,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 20:35:11,120 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~VOIDErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:11,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:11,120 INFO L85 PathProgramCache]: Analyzing trace with hash -621247757, now seen corresponding path program 1 times [2023-11-23 20:35:11,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:11,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857082082] [2023-11-23 20:35:11,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:11,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 20:35:11,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:11,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857082082] [2023-11-23 20:35:11,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857082082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:11,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:11,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 20:35:11,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784398252] [2023-11-23 20:35:11,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:11,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:35:11,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:11,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:35:11,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:35:11,477 INFO L87 Difference]: Start difference. First operand 257 states and 306 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:11,955 INFO L93 Difference]: Finished difference Result 255 states and 304 transitions. [2023-11-23 20:35:11,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:35:11,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-23 20:35:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:11,957 INFO L225 Difference]: With dead ends: 255 [2023-11-23 20:35:11,958 INFO L226 Difference]: Without dead ends: 255 [2023-11-23 20:35:11,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 20:35:11,958 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 41 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:11,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 632 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 20:35:11,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-11-23 20:35:11,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2023-11-23 20:35:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 133 states have (on average 1.8721804511278195) internal successors, (249), 231 states have internal predecessors, (249), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2023-11-23 20:35:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 304 transitions. [2023-11-23 20:35:11,968 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 304 transitions. Word has length 23 [2023-11-23 20:35:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:11,969 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 304 transitions. [2023-11-23 20:35:11,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 304 transitions. [2023-11-23 20:35:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 20:35:11,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:11,970 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:11,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 20:35:11,970 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~VOIDErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:11,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:11,971 INFO L85 PathProgramCache]: Analyzing trace with hash -2078794002, now seen corresponding path program 1 times [2023-11-23 20:35:11,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:11,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668495283] [2023-11-23 20:35:11,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:11,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 20:35:12,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:12,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668495283] [2023-11-23 20:35:12,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668495283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:12,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:12,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 20:35:12,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826735924] [2023-11-23 20:35:12,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:12,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:35:12,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:12,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:35:12,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:35:12,135 INFO L87 Difference]: Start difference. First operand 255 states and 304 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:12,336 INFO L93 Difference]: Finished difference Result 254 states and 303 transitions. [2023-11-23 20:35:12,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:35:12,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-23 20:35:12,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:12,340 INFO L225 Difference]: With dead ends: 254 [2023-11-23 20:35:12,341 INFO L226 Difference]: Without dead ends: 254 [2023-11-23 20:35:12,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:35:12,343 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 7 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:12,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 488 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:35:12,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-11-23 20:35:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2023-11-23 20:35:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 133 states have (on average 1.8646616541353382) internal successors, (248), 230 states have internal predecessors, (248), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2023-11-23 20:35:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 303 transitions. [2023-11-23 20:35:12,355 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 303 transitions. Word has length 24 [2023-11-23 20:35:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:12,355 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 303 transitions. [2023-11-23 20:35:12,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:12,356 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 303 transitions. [2023-11-23 20:35:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 20:35:12,357 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:12,357 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:12,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 20:35:12,357 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~VOIDErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:12,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:12,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2078794001, now seen corresponding path program 1 times [2023-11-23 20:35:12,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:12,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781877163] [2023-11-23 20:35:12,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:12,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 20:35:12,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:12,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781877163] [2023-11-23 20:35:12,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781877163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:12,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:12,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 20:35:12,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571878428] [2023-11-23 20:35:12,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:12,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:35:12,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:12,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:35:12,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:35:12,528 INFO L87 Difference]: Start difference. First operand 254 states and 303 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:12,705 INFO L93 Difference]: Finished difference Result 253 states and 302 transitions. [2023-11-23 20:35:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:35:12,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-23 20:35:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:12,708 INFO L225 Difference]: With dead ends: 253 [2023-11-23 20:35:12,708 INFO L226 Difference]: Without dead ends: 253 [2023-11-23 20:35:12,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:35:12,709 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 6 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:12,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 555 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:35:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-11-23 20:35:12,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2023-11-23 20:35:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 133 states have (on average 1.8571428571428572) internal successors, (247), 229 states have internal predecessors, (247), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2023-11-23 20:35:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 302 transitions. [2023-11-23 20:35:12,718 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 302 transitions. Word has length 24 [2023-11-23 20:35:12,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:12,718 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 302 transitions. [2023-11-23 20:35:12,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 302 transitions. [2023-11-23 20:35:12,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 20:35:12,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:12,720 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:12,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 20:35:12,720 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:12,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:12,720 INFO L85 PathProgramCache]: Analyzing trace with hash -561240689, now seen corresponding path program 1 times [2023-11-23 20:35:12,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:12,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211477826] [2023-11-23 20:35:12,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:12,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 20:35:13,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211477826] [2023-11-23 20:35:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211477826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:13,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:13,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 20:35:13,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588492822] [2023-11-23 20:35:13,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:13,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 20:35:13,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:13,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 20:35:13,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 20:35:13,154 INFO L87 Difference]: Start difference. First operand 253 states and 302 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:13,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:13,687 INFO L93 Difference]: Finished difference Result 260 states and 309 transitions. [2023-11-23 20:35:13,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 20:35:13,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-23 20:35:13,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:13,690 INFO L225 Difference]: With dead ends: 260 [2023-11-23 20:35:13,690 INFO L226 Difference]: Without dead ends: 260 [2023-11-23 20:35:13,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-23 20:35:13,691 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 10 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:13,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1187 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 20:35:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-23 20:35:13,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2023-11-23 20:35:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 138 states have (on average 1.826086956521739) internal successors, (252), 234 states have internal predecessors, (252), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2023-11-23 20:35:13,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 307 transitions. [2023-11-23 20:35:13,700 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 307 transitions. Word has length 26 [2023-11-23 20:35:13,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:13,701 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 307 transitions. [2023-11-23 20:35:13,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 307 transitions. [2023-11-23 20:35:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-23 20:35:13,702 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:13,702 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:13,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 20:35:13,703 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:13,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:13,703 INFO L85 PathProgramCache]: Analyzing trace with hash 422305593, now seen corresponding path program 1 times [2023-11-23 20:35:13,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:13,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839719446] [2023-11-23 20:35:13,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:13,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 20:35:14,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:14,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839719446] [2023-11-23 20:35:14,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839719446] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:35:14,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185063940] [2023-11-23 20:35:14,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:14,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:35:14,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:35:14,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:35:14,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 20:35:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:14,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-23 20:35:14,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:35:14,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 20:35:15,125 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-23 20:35:15,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-23 20:35:15,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:35:15,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-23 20:35:15,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:35:15,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-23 20:35:15,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-23 20:35:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 20:35:15,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:35:15,692 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_25| Int)) (or (< |c_#StackHeapBarrier| (+ |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_25| 1)) (= (select (store |c_#valid| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_25| 1) (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_25| v_ArrVal_546) |c_##fun~$Pointer$~TO~VOID_#~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#~10#1.offset|)) 1))) is different from false [2023-11-23 20:35:15,707 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_25| Int)) (or (= (select (store |c_#valid| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_25| 1) (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_25| v_ArrVal_546) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)) 1) (< |c_#StackHeapBarrier| (+ |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_25| 1)))) is different from false [2023-11-23 20:35:15,725 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_25| Int)) (or (= (select (store |c_#valid| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_25| 1) (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_25| v_ArrVal_546) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|)) 1) (< |c_#StackHeapBarrier| (+ |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_25| 1)))) is different from false [2023-11-23 20:35:15,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:35:15,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-11-23 20:35:15,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2023-11-23 20:35:15,832 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-11-23 20:35:15,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2023-11-23 20:35:15,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 20:35:15,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:35:15,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-11-23 20:35:15,965 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:35:15,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:35:15,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2023-11-23 20:35:18,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:35:18,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 87 [2023-11-23 20:35:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2023-11-23 20:35:20,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185063940] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:35:20,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1434035805] [2023-11-23 20:35:20,330 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-11-23 20:35:20,331 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:35:20,335 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-23 20:35:20,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 20:35:20,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2023-11-23 20:35:20,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338127215] [2023-11-23 20:35:20,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 20:35:20,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-23 20:35:20,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:20,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-23 20:35:20,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=784, Unknown=4, NotChecked=174, Total=1056 [2023-11-23 20:35:20,342 INFO L87 Difference]: Start difference. First operand 258 states and 307 transitions. Second operand has 33 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 28 states have internal predecessors, (58), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 20:35:22,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:22,328 INFO L93 Difference]: Finished difference Result 260 states and 308 transitions. [2023-11-23 20:35:22,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 20:35:22,329 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 28 states have internal predecessors, (58), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2023-11-23 20:35:22,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:22,331 INFO L225 Difference]: With dead ends: 260 [2023-11-23 20:35:22,331 INFO L226 Difference]: Without dead ends: 260 [2023-11-23 20:35:22,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=224, Invalid=1344, Unknown=4, NotChecked=234, Total=1806 [2023-11-23 20:35:22,333 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 80 mSDsluCounter, 2852 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 2208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:22,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 3053 Invalid, 2208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1731 Invalid, 0 Unknown, 430 Unchecked, 1.4s Time] [2023-11-23 20:35:22,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-23 20:35:22,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2023-11-23 20:35:22,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 140 states have (on average 1.8071428571428572) internal successors, (253), 236 states have internal predecessors, (253), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2023-11-23 20:35:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 308 transitions. [2023-11-23 20:35:22,344 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 308 transitions. Word has length 37 [2023-11-23 20:35:22,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:22,346 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 308 transitions. [2023-11-23 20:35:22,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 28 states have internal predecessors, (58), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 20:35:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 308 transitions. [2023-11-23 20:35:22,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-23 20:35:22,348 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:22,348 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:22,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 20:35:22,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-23 20:35:22,571 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~VOIDErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:22,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:22,571 INFO L85 PathProgramCache]: Analyzing trace with hash 422305594, now seen corresponding path program 1 times [2023-11-23 20:35:22,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:22,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451475874] [2023-11-23 20:35:22,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:22,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 20:35:23,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:23,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451475874] [2023-11-23 20:35:23,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451475874] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:35:23,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802120499] [2023-11-23 20:35:23,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:23,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:35:23,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:35:23,756 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:35:23,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 20:35:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:23,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-23 20:35:23,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:35:24,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 20:35:24,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 20:35:24,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 20:35:24,340 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-23 20:35:24,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-11-23 20:35:24,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:35:24,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-23 20:35:24,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:35:24,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 20:35:24,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:35:24,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-23 20:35:24,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:35:24,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 20:35:24,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-23 20:35:24,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-23 20:35:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 20:35:24,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:35:24,664 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_706 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_706) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|)))) (forall ((v_ArrVal_706 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_706) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_707) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|))))) is different from false [2023-11-23 20:35:28,901 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_33| Int)) (or (forall ((v_ArrVal_706 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_33| v_ArrVal_706) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)) (select (store |c_#length| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_33| 8) (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_33| v_ArrVal_707) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)))) (< |c_#StackHeapBarrier| (+ |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_33| 1)))) (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_33| Int)) (or (forall ((v_ArrVal_706 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_33| v_ArrVal_706) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)))) (< |c_#StackHeapBarrier| (+ |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_33| 1))))) is different from false [2023-11-23 20:35:35,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:35:35,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2023-11-23 20:35:35,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2023-11-23 20:35:35,273 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 20:35:35,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2023-11-23 20:35:35,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:35:35,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2023-11-23 20:35:35,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:35:35,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2023-11-23 20:35:35,532 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:35:35,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:35:35,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2023-11-23 20:35:35,551 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:35:35,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:35:35,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-11-23 20:35:35,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:35:35,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2023-11-23 20:35:35,616 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:35:35,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-23 20:35:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-11-23 20:35:36,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802120499] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:35:36,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2095829935] [2023-11-23 20:35:36,015 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-11-23 20:35:36,015 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:35:36,015 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-23 20:35:36,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 20:35:36,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2023-11-23 20:35:36,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653362371] [2023-11-23 20:35:36,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 20:35:36,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-23 20:35:36,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:36,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-23 20:35:36,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=874, Unknown=29, NotChecked=122, Total=1122 [2023-11-23 20:35:36,021 INFO L87 Difference]: Start difference. First operand 260 states and 308 transitions. Second operand has 34 states, 28 states have (on average 2.25) internal successors, (63), 29 states have internal predecessors, (63), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 20:35:38,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:38,753 INFO L93 Difference]: Finished difference Result 259 states and 307 transitions. [2023-11-23 20:35:38,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 20:35:38,753 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 2.25) internal successors, (63), 29 states have internal predecessors, (63), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2023-11-23 20:35:38,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:38,755 INFO L225 Difference]: With dead ends: 259 [2023-11-23 20:35:38,755 INFO L226 Difference]: Without dead ends: 259 [2023-11-23 20:35:38,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=251, Invalid=1534, Unknown=29, NotChecked=166, Total=1980 [2023-11-23 20:35:38,757 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 85 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 2512 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:38,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 2512 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1701 Invalid, 0 Unknown, 265 Unchecked, 1.7s Time] [2023-11-23 20:35:38,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-11-23 20:35:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2023-11-23 20:35:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 140 states have (on average 1.8) internal successors, (252), 235 states have internal predecessors, (252), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2023-11-23 20:35:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 307 transitions. [2023-11-23 20:35:38,766 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 307 transitions. Word has length 37 [2023-11-23 20:35:38,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:38,766 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 307 transitions. [2023-11-23 20:35:38,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 2.25) internal successors, (63), 29 states have internal predecessors, (63), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 20:35:38,767 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 307 transitions. [2023-11-23 20:35:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-23 20:35:38,771 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:38,771 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:38,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 20:35:38,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-23 20:35:38,988 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:38,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:38,988 INFO L85 PathProgramCache]: Analyzing trace with hash -551666034, now seen corresponding path program 1 times [2023-11-23 20:35:38,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:38,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731478034] [2023-11-23 20:35:38,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:38,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:39,158 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 20:35:39,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:39,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731478034] [2023-11-23 20:35:39,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731478034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:39,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:39,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 20:35:39,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690891579] [2023-11-23 20:35:39,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:39,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 20:35:39,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:39,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 20:35:39,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:35:39,161 INFO L87 Difference]: Start difference. First operand 259 states and 307 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 20:35:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:39,303 INFO L93 Difference]: Finished difference Result 248 states and 284 transitions. [2023-11-23 20:35:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 20:35:39,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2023-11-23 20:35:39,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:39,307 INFO L225 Difference]: With dead ends: 248 [2023-11-23 20:35:39,308 INFO L226 Difference]: Without dead ends: 248 [2023-11-23 20:35:39,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:35:39,309 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 19 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:39,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 811 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:39,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-23 20:35:39,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2023-11-23 20:35:39,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 132 states have (on average 1.8106060606060606) internal successors, (239), 227 states have internal predecessors, (239), 29 states have call successors, (29), 11 states have call predecessors, (29), 9 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2023-11-23 20:35:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 284 transitions. [2023-11-23 20:35:39,318 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 284 transitions. Word has length 40 [2023-11-23 20:35:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:39,318 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 284 transitions. [2023-11-23 20:35:39,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 20:35:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 284 transitions. [2023-11-23 20:35:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-23 20:35:39,320 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:39,320 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:39,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 20:35:39,321 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:39,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:39,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1758370675, now seen corresponding path program 1 times [2023-11-23 20:35:39,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:39,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193368042] [2023-11-23 20:35:39,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:39,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 20:35:40,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:40,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193368042] [2023-11-23 20:35:40,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193368042] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:35:40,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969605565] [2023-11-23 20:35:40,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:40,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:35:40,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:35:40,233 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:35:40,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 20:35:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:40,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-23 20:35:40,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:35:40,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 20:35:40,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-23 20:35:40,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 20:35:41,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 86 [2023-11-23 20:35:41,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2023-11-23 20:35:41,302 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-23 20:35:41,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 44 [2023-11-23 20:35:41,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2023-11-23 20:35:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 20:35:41,318 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:35:42,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969605565] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:35:42,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1986411952] [2023-11-23 20:35:42,101 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-11-23 20:35:42,102 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:35:42,102 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-23 20:35:42,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 20:35:42,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2023-11-23 20:35:42,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656636756] [2023-11-23 20:35:42,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 20:35:42,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-23 20:35:42,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:42,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-23 20:35:42,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2023-11-23 20:35:42,106 INFO L87 Difference]: Start difference. First operand 248 states and 284 transitions. Second operand has 25 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 20:35:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:45,485 INFO L93 Difference]: Finished difference Result 251 states and 286 transitions. [2023-11-23 20:35:45,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 20:35:45,486 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-11-23 20:35:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:45,488 INFO L225 Difference]: With dead ends: 251 [2023-11-23 20:35:45,488 INFO L226 Difference]: Without dead ends: 248 [2023-11-23 20:35:45,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=161, Invalid=1171, Unknown=0, NotChecked=0, Total=1332 [2023-11-23 20:35:45,490 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 91 mSDsluCounter, 2249 mSDsCounter, 0 mSdLazyCounter, 2866 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 2894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2866 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:45,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 2391 Invalid, 2894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2866 Invalid, 2 Unknown, 0 Unchecked, 2.7s Time] [2023-11-23 20:35:45,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-23 20:35:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2023-11-23 20:35:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 132 states have (on average 1.803030303030303) internal successors, (238), 227 states have internal predecessors, (238), 29 states have call successors, (29), 11 states have call predecessors, (29), 9 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2023-11-23 20:35:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 283 transitions. [2023-11-23 20:35:45,498 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 283 transitions. Word has length 46 [2023-11-23 20:35:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:45,499 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 283 transitions. [2023-11-23 20:35:45,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 20:35:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 283 transitions. [2023-11-23 20:35:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-23 20:35:45,500 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:45,500 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:45,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 20:35:45,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:35:45,715 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2023-11-23 20:35:45,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:45,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1731128146, now seen corresponding path program 1 times [2023-11-23 20:35:45,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:45,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137330067] [2023-11-23 20:35:45,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:45,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:48,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:48,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137330067] [2023-11-23 20:35:48,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137330067] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:35:48,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861825860] [2023-11-23 20:35:48,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:48,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:35:48,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:35:48,386 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:35:48,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df95515-4226-439a-a1b9-6f44e2a90434/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 20:35:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:48,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-23 20:35:48,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:35:48,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 20:35:48,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 20:35:49,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 46 [2023-11-23 20:35:49,123 INFO L349 Elim1Store]: treesize reduction 33, result has 37.7 percent of original size [2023-11-23 20:35:49,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 97 [2023-11-23 20:35:49,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:35:49,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28