./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 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_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX --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 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:53:49,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:53:49,943 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:53:49,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:53:49,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:53:49,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:53:49,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:53:49,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:53:49,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:53:49,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:53:49,986 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:53:49,987 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:53:49,988 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:53:49,988 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:53:49,989 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:53:49,989 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:53:49,990 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:53:49,990 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:53:49,991 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:53:49,992 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:53:49,992 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:53:49,993 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:53:49,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:53:49,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:53:49,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:53:49,995 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:53:49,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:53:49,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:53:49,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:53:49,997 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:53:49,997 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:53:49,998 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:53:49,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:53:49,998 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:53:49,999 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:53:49,999 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:53:49,999 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:53:49,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:53:50,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:53:50,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:53:50,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:53:50,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:53:50,001 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:53:50,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:53:50,001 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:53:50,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:53:50,002 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_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX/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_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX 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 -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2023-11-12 00:53:50,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:53:50,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:53:50,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:53:50,342 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:53:50,344 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:53:50,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/forester-heap/dll-token-1.i [2023-11-12 00:53:53,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:53:53,892 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:53:53,893 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/sv-benchmarks/c/forester-heap/dll-token-1.i [2023-11-12 00:53:53,907 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX/data/49772ae62/be3b92d825084f819ae76034783fe16c/FLAGdc8ac4b44 [2023-11-12 00:53:53,922 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX/data/49772ae62/be3b92d825084f819ae76034783fe16c [2023-11-12 00:53:53,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:53:53,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:53:53,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:53:53,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:53:53,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:53:53,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:53:53" (1/1) ... [2023-11-12 00:53:53,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c299685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:53, skipping insertion in model container [2023-11-12 00:53:53,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:53:53" (1/1) ... [2023-11-12 00:53:53,984 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:53:54,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:53:54,361 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:53:54,404 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:53:54,439 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:53:54,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:54 WrapperNode [2023-11-12 00:53:54,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:53:54,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:53:54,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:53:54,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:53:54,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:54" (1/1) ... [2023-11-12 00:53:54,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:54" (1/1) ... [2023-11-12 00:53:54,489 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2023-11-12 00:53:54,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:53:54,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:53:54,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:53:54,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:53:54,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:54" (1/1) ... [2023-11-12 00:53:54,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:54" (1/1) ... [2023-11-12 00:53:54,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:54" (1/1) ... [2023-11-12 00:53:54,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:54" (1/1) ... [2023-11-12 00:53:54,518 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:54" (1/1) ... [2023-11-12 00:53:54,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:54" (1/1) ... [2023-11-12 00:53:54,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:54" (1/1) ... [2023-11-12 00:53:54,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:54" (1/1) ... [2023-11-12 00:53:54,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:53:54,533 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:53:54,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:53:54,533 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:53:54,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:54" (1/1) ... [2023-11-12 00:53:54,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:53:54,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:53:54,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:53:54,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:53:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-12 00:53:54,604 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-12 00:53:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:53:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:53:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:53:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:53:54,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:53:54,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:53:54,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:53:54,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:53:54,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:53:54,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:53:54,718 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:53:54,720 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:53:55,170 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:53:55,229 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:53:55,230 INFO L302 CfgBuilder]: Removed 15 assume(true) statements. [2023-11-12 00:53:55,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:53:55 BoogieIcfgContainer [2023-11-12 00:53:55,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:53:55,240 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:53:55,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:53:55,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:53:55,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:53:53" (1/3) ... [2023-11-12 00:53:55,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0f8109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:53:55, skipping insertion in model container [2023-11-12 00:53:55,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:54" (2/3) ... [2023-11-12 00:53:55,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0f8109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:53:55, skipping insertion in model container [2023-11-12 00:53:55,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:53:55" (3/3) ... [2023-11-12 00:53:55,250 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2023-11-12 00:53:55,274 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:53:55,276 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2023-11-12 00:53:55,330 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:53:55,338 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;@3ecd1227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:53:55,338 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-11-12 00:53:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 61 states have (on average 2.377049180327869) internal successors, (145), 120 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 00:53:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-12 00:53:55,348 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:55,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-12 00:53:55,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:53:55,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash 9499, now seen corresponding path program 1 times [2023-11-12 00:53:55,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:55,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608591169] [2023-11-12 00:53:55,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:55,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:55,584 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-12 00:53:55,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:55,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608591169] [2023-11-12 00:53:55,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608591169] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:55,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:55,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:53:55,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188973067] [2023-11-12 00:53:55,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:55,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:53:55,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:55,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:53:55,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:53:55,645 INFO L87 Difference]: Start difference. First operand has 128 states, 61 states have (on average 2.377049180327869) internal successors, (145), 120 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:55,866 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2023-11-12 00:53:55,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:53:55,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-12 00:53:55,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:55,878 INFO L225 Difference]: With dead ends: 136 [2023-11-12 00:53:55,878 INFO L226 Difference]: Without dead ends: 135 [2023-11-12 00:53:55,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:53:55,885 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 94 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:55,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 91 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:53:55,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-12 00:53:55,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2023-11-12 00:53:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 54 states have (on average 2.1666666666666665) internal successors, (117), 114 states have internal predecessors, (117), 6 states have call successors, (6), 1 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-12 00:53:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2023-11-12 00:53:55,934 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 2 [2023-11-12 00:53:55,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:55,934 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2023-11-12 00:53:55,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2023-11-12 00:53:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-12 00:53:55,935 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:55,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-12 00:53:55,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:53:55,936 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:53:55,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:55,937 INFO L85 PathProgramCache]: Analyzing trace with hash 9500, now seen corresponding path program 1 times [2023-11-12 00:53:55,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:55,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548260520] [2023-11-12 00:53:55,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:55,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:56,073 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-12 00:53:56,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:56,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548260520] [2023-11-12 00:53:56,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548260520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:56,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:56,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:53:56,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039857542] [2023-11-12 00:53:56,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:56,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:53:56,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:56,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:53:56,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:53:56,078 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:56,263 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2023-11-12 00:53:56,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:53:56,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-12 00:53:56,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:56,268 INFO L225 Difference]: With dead ends: 140 [2023-11-12 00:53:56,269 INFO L226 Difference]: Without dead ends: 140 [2023-11-12 00:53:56,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:53:56,273 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 99 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:56,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 96 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:53:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-12 00:53:56,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 113. [2023-11-12 00:53:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 54 states have (on average 2.111111111111111) internal successors, (114), 111 states have internal predecessors, (114), 6 states have call successors, (6), 1 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-12 00:53:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2023-11-12 00:53:56,295 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 2 [2023-11-12 00:53:56,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:56,295 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2023-11-12 00:53:56,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:56,296 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2023-11-12 00:53:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:53:56,296 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:56,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:56,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:53:56,298 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:53:56,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:56,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1358927011, now seen corresponding path program 1 times [2023-11-12 00:53:56,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:56,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099068712] [2023-11-12 00:53:56,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:56,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:56,448 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-12 00:53:56,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:56,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099068712] [2023-11-12 00:53:56,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099068712] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:56,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:56,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:53:56,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65021429] [2023-11-12 00:53:56,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:56,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:53:56,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:56,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:53:56,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:53:56,451 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:56,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:56,651 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-11-12 00:53:56,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:53:56,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-12 00:53:56,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:56,654 INFO L225 Difference]: With dead ends: 116 [2023-11-12 00:53:56,654 INFO L226 Difference]: Without dead ends: 116 [2023-11-12 00:53:56,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:53:56,656 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 159 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:56,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 67 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:53:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-12 00:53:56,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2023-11-12 00:53:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 98 states have internal predecessors, (103), 6 states have call successors, (6), 1 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-12 00:53:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2023-11-12 00:53:56,667 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 7 [2023-11-12 00:53:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:56,667 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2023-11-12 00:53:56,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2023-11-12 00:53:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:53:56,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:56,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:56,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:53:56,673 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:53:56,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:56,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1358927012, now seen corresponding path program 1 times [2023-11-12 00:53:56,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:56,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909566583] [2023-11-12 00:53:56,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:56,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:56,858 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-12 00:53:56,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:56,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909566583] [2023-11-12 00:53:56,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909566583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:56,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:56,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:53:56,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818602202] [2023-11-12 00:53:56,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:56,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:53:56,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:56,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:53:56,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:53:56,862 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:57,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:57,137 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2023-11-12 00:53:57,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:53:57,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-12 00:53:57,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:57,140 INFO L225 Difference]: With dead ends: 178 [2023-11-12 00:53:57,140 INFO L226 Difference]: Without dead ends: 178 [2023-11-12 00:53:57,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:53:57,142 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 185 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:57,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 97 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:53:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-12 00:53:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 131. [2023-11-12 00:53:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 87 states have (on average 1.6666666666666667) internal successors, (145), 129 states have internal predecessors, (145), 6 states have call successors, (6), 1 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-12 00:53:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2023-11-12 00:53:57,157 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 7 [2023-11-12 00:53:57,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:57,158 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2023-11-12 00:53:57,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2023-11-12 00:53:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:53:57,159 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:57,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:57,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:53:57,165 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:53:57,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:57,166 INFO L85 PathProgramCache]: Analyzing trace with hash 259058291, now seen corresponding path program 1 times [2023-11-12 00:53:57,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:57,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202107250] [2023-11-12 00:53:57,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:57,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:57,384 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-12 00:53:57,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:57,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202107250] [2023-11-12 00:53:57,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202107250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:57,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:57,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:53:57,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949404694] [2023-11-12 00:53:57,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:57,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:53:57,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:57,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:53:57,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:53:57,387 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:57,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:57,578 INFO L93 Difference]: Finished difference Result 130 states and 149 transitions. [2023-11-12 00:53:57,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:53:57,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-12 00:53:57,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:57,580 INFO L225 Difference]: With dead ends: 130 [2023-11-12 00:53:57,581 INFO L226 Difference]: Without dead ends: 130 [2023-11-12 00:53:57,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-12 00:53:57,585 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 6 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:57,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 250 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:53:57,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-12 00:53:57,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2023-11-12 00:53:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 128 states have internal predecessors, (143), 6 states have call successors, (6), 1 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-12 00:53:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2023-11-12 00:53:57,602 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 149 transitions. Word has length 9 [2023-11-12 00:53:57,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:57,602 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 149 transitions. [2023-11-12 00:53:57,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 149 transitions. [2023-11-12 00:53:57,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:53:57,603 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:57,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:57,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:53:57,604 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:53:57,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:57,604 INFO L85 PathProgramCache]: Analyzing trace with hash 259058292, now seen corresponding path program 1 times [2023-11-12 00:53:57,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:57,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272279832] [2023-11-12 00:53:57,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:57,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:57,870 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-12 00:53:57,870 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:57,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272279832] [2023-11-12 00:53:57,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272279832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:57,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:57,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:53:57,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729483242] [2023-11-12 00:53:57,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:57,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:53:57,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:57,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:53:57,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:53:57,873 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:58,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:58,063 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2023-11-12 00:53:58,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:53:58,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-12 00:53:58,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:58,066 INFO L225 Difference]: With dead ends: 129 [2023-11-12 00:53:58,067 INFO L226 Difference]: Without dead ends: 129 [2023-11-12 00:53:58,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-12 00:53:58,078 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:58,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 243 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:53:58,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-12 00:53:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-11-12 00:53:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 87 states have (on average 1.6206896551724137) internal successors, (141), 127 states have internal predecessors, (141), 6 states have call successors, (6), 1 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-12 00:53:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2023-11-12 00:53:58,088 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 9 [2023-11-12 00:53:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:58,088 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2023-11-12 00:53:58,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2023-11-12 00:53:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:53:58,089 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:58,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:58,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:53:58,090 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:53:58,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:58,090 INFO L85 PathProgramCache]: Analyzing trace with hash -560891636, now seen corresponding path program 1 times [2023-11-12 00:53:58,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:58,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486136487] [2023-11-12 00:53:58,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:58,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:58,218 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-12 00:53:58,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486136487] [2023-11-12 00:53:58,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486136487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:58,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:58,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:53:58,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821168636] [2023-11-12 00:53:58,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:58,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:53:58,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:58,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:53:58,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:53:58,221 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:58,366 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2023-11-12 00:53:58,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:53:58,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-12 00:53:58,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:58,368 INFO L225 Difference]: With dead ends: 128 [2023-11-12 00:53:58,368 INFO L226 Difference]: Without dead ends: 128 [2023-11-12 00:53:58,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-12 00:53:58,372 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:58,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 242 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:53:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-12 00:53:58,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-11-12 00:53:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 87 states have (on average 1.5977011494252873) internal successors, (139), 126 states have internal predecessors, (139), 6 states have call successors, (6), 1 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-12 00:53:58,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2023-11-12 00:53:58,392 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 10 [2023-11-12 00:53:58,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:58,392 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2023-11-12 00:53:58,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:58,393 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2023-11-12 00:53:58,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:53:58,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:58,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:58,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:53:58,394 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:53:58,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:58,394 INFO L85 PathProgramCache]: Analyzing trace with hash -560891635, now seen corresponding path program 1 times [2023-11-12 00:53:58,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:58,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525841141] [2023-11-12 00:53:58,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:58,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:58,670 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-12 00:53:58,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:58,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525841141] [2023-11-12 00:53:58,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525841141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:58,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:58,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:53:58,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195124858] [2023-11-12 00:53:58,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:58,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:53:58,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:58,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:53:58,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:53:58,673 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:58,837 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2023-11-12 00:53:58,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:53:58,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-12 00:53:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:58,839 INFO L225 Difference]: With dead ends: 127 [2023-11-12 00:53:58,839 INFO L226 Difference]: Without dead ends: 127 [2023-11-12 00:53:58,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-12 00:53:58,843 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:58,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 238 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:53:58,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-12 00:53:58,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-11-12 00:53:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 87 states have (on average 1.5747126436781609) internal successors, (137), 125 states have internal predecessors, (137), 6 states have call successors, (6), 1 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-12 00:53:58,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2023-11-12 00:53:58,853 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 10 [2023-11-12 00:53:58,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:58,853 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2023-11-12 00:53:58,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:58,853 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2023-11-12 00:53:58,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:53:58,854 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:58,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:58,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 00:53:58,855 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:53:58,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:58,856 INFO L85 PathProgramCache]: Analyzing trace with hash -152845188, now seen corresponding path program 1 times [2023-11-12 00:53:58,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:58,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782078510] [2023-11-12 00:53:58,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:58,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:59,114 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-12 00:53:59,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:59,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782078510] [2023-11-12 00:53:59,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782078510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:59,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:59,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 00:53:59,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86108113] [2023-11-12 00:53:59,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:59,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 00:53:59,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:59,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 00:53:59,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:53:59,117 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:59,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:59,419 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2023-11-12 00:53:59,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:53:59,421 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-12 00:53:59,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:59,422 INFO L225 Difference]: With dead ends: 130 [2023-11-12 00:53:59,422 INFO L226 Difference]: Without dead ends: 130 [2023-11-12 00:53:59,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-12 00:53:59,425 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 151 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:59,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 152 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:53:59,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-12 00:53:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2023-11-12 00:53:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 87 states have (on average 1.5632183908045978) internal successors, (136), 124 states have internal predecessors, (136), 6 states have call successors, (6), 1 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-12 00:53:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2023-11-12 00:53:59,431 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 11 [2023-11-12 00:53:59,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:59,432 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2023-11-12 00:53:59,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:59,432 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2023-11-12 00:53:59,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:53:59,433 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:59,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:59,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 00:53:59,434 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:53:59,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:59,435 INFO L85 PathProgramCache]: Analyzing trace with hash -152845187, now seen corresponding path program 1 times [2023-11-12 00:53:59,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:59,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690975962] [2023-11-12 00:53:59,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:59,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:59,798 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-12 00:53:59,798 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:59,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690975962] [2023-11-12 00:53:59,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690975962] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:59,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:59,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 00:53:59,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938107781] [2023-11-12 00:53:59,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:59,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 00:53:59,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:59,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 00:53:59,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:53:59,801 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:00,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:00,303 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2023-11-12 00:54:00,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 00:54:00,304 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-12 00:54:00,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:00,305 INFO L225 Difference]: With dead ends: 125 [2023-11-12 00:54:00,306 INFO L226 Difference]: Without dead ends: 125 [2023-11-12 00:54:00,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-12 00:54:00,307 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 144 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:00,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 207 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:54:00,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-12 00:54:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2023-11-12 00:54:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 76 states have (on average 1.5263157894736843) internal successors, (116), 105 states have internal predecessors, (116), 6 states have call successors, (6), 1 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-12 00:54:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2023-11-12 00:54:00,311 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 11 [2023-11-12 00:54:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:00,312 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2023-11-12 00:54:00,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2023-11-12 00:54:00,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:54:00,312 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:00,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:00,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 00:54:00,313 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:54:00,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:00,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2145763889, now seen corresponding path program 1 times [2023-11-12 00:54:00,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:00,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468032091] [2023-11-12 00:54:00,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:00,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:00,578 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-12 00:54:00,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:00,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468032091] [2023-11-12 00:54:00,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468032091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:00,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:00,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 00:54:00,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094052666] [2023-11-12 00:54:00,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:00,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:54:00,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:00,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:54:00,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:54:00,582 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:00,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:00,773 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2023-11-12 00:54:00,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:54:00,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-12 00:54:00,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:00,775 INFO L225 Difference]: With dead ends: 106 [2023-11-12 00:54:00,775 INFO L226 Difference]: Without dead ends: 106 [2023-11-12 00:54:00,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:54:00,776 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:00,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:54:00,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-12 00:54:00,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-11-12 00:54:00,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.513157894736842) internal successors, (115), 104 states have internal predecessors, (115), 6 states have call successors, (6), 1 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-12 00:54:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2023-11-12 00:54:00,781 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 12 [2023-11-12 00:54:00,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:00,781 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2023-11-12 00:54:00,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2023-11-12 00:54:00,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:54:00,782 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:00,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:00,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 00:54:00,782 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:54:00,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:00,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2145763888, now seen corresponding path program 1 times [2023-11-12 00:54:00,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:00,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017058789] [2023-11-12 00:54:00,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:00,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:01,100 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-12 00:54:01,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:01,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017058789] [2023-11-12 00:54:01,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017058789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:01,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:01,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 00:54:01,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273390285] [2023-11-12 00:54:01,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:01,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:54:01,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:01,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:54:01,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:54:01,103 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:01,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:01,327 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2023-11-12 00:54:01,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:54:01,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-12 00:54:01,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:01,328 INFO L225 Difference]: With dead ends: 105 [2023-11-12 00:54:01,329 INFO L226 Difference]: Without dead ends: 105 [2023-11-12 00:54:01,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:54:01,330 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:01,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 249 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:54:01,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-12 00:54:01,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-11-12 00:54:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.5) internal successors, (114), 103 states have internal predecessors, (114), 6 states have call successors, (6), 1 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-12 00:54:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2023-11-12 00:54:01,334 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 12 [2023-11-12 00:54:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:01,335 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2023-11-12 00:54:01,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2023-11-12 00:54:01,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:54:01,336 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:01,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:01,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 00:54:01,337 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:54:01,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1639718935, now seen corresponding path program 1 times [2023-11-12 00:54:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:01,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925171591] [2023-11-12 00:54:01,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:01,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:01,558 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-12 00:54:01,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:01,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925171591] [2023-11-12 00:54:01,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925171591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:01,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:01,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 00:54:01,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902706479] [2023-11-12 00:54:01,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:01,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 00:54:01,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:01,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 00:54:01,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:54:01,561 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:02,037 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2023-11-12 00:54:02,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 00:54:02,038 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-12 00:54:02,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:02,039 INFO L225 Difference]: With dead ends: 120 [2023-11-12 00:54:02,039 INFO L226 Difference]: Without dead ends: 120 [2023-11-12 00:54:02,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-12 00:54:02,040 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 136 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:02,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 242 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:54:02,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-12 00:54:02,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2023-11-12 00:54:02,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.486842105263158) internal successors, (113), 102 states have internal predecessors, (113), 5 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-12 00:54:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2023-11-12 00:54:02,045 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 15 [2023-11-12 00:54:02,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:02,045 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2023-11-12 00:54:02,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2023-11-12 00:54:02,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:54:02,046 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:02,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:02,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 00:54:02,046 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:54:02,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:02,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1424546549, now seen corresponding path program 1 times [2023-11-12 00:54:02,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:02,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750069404] [2023-11-12 00:54:02,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:02,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:02,121 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-12 00:54:02,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:02,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750069404] [2023-11-12 00:54:02,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750069404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:02,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:02,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:54:02,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996198919] [2023-11-12 00:54:02,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:02,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:54:02,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:02,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:54:02,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:54:02,124 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:02,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:02,246 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2023-11-12 00:54:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:54:02,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-12 00:54:02,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:02,248 INFO L225 Difference]: With dead ends: 154 [2023-11-12 00:54:02,248 INFO L226 Difference]: Without dead ends: 154 [2023-11-12 00:54:02,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:54:02,249 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 148 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:02,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 122 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:54:02,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-12 00:54:02,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 103. [2023-11-12 00:54:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 101 states have internal predecessors, (112), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2023-11-12 00:54:02,259 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 16 [2023-11-12 00:54:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:02,260 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2023-11-12 00:54:02,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2023-11-12 00:54:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:54:02,261 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:02,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:02,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 00:54:02,261 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:54:02,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:02,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1466154771, now seen corresponding path program 1 times [2023-11-12 00:54:02,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:02,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951153903] [2023-11-12 00:54:02,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:02,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:02,341 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-12 00:54:02,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:02,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951153903] [2023-11-12 00:54:02,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951153903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:02,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:02,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:54:02,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510039068] [2023-11-12 00:54:02,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:02,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:54:02,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:02,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:54:02,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:54:02,344 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:02,467 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2023-11-12 00:54:02,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:54:02,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-12 00:54:02,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:02,469 INFO L225 Difference]: With dead ends: 102 [2023-11-12 00:54:02,469 INFO L226 Difference]: Without dead ends: 102 [2023-11-12 00:54:02,469 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-12 00:54:02,470 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:02,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 195 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:54:02,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-12 00:54:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-12 00:54:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 100 states have internal predecessors, (110), 3 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-12 00:54:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2023-11-12 00:54:02,474 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 21 [2023-11-12 00:54:02,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:02,474 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2023-11-12 00:54:02,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:02,474 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2023-11-12 00:54:02,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:54:02,475 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:02,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:02,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 00:54:02,476 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:54:02,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:02,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1434637815, now seen corresponding path program 1 times [2023-11-12 00:54:02,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:02,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796632020] [2023-11-12 00:54:02,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:02,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:03,250 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-12 00:54:03,251 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796632020] [2023-11-12 00:54:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796632020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:03,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:03,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-12 00:54:03,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328735421] [2023-11-12 00:54:03,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:03,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 00:54:03,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:03,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 00:54:03,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-12 00:54:03,254 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:03,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:03,758 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2023-11-12 00:54:03,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 00:54:03,759 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-12 00:54:03,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:03,760 INFO L225 Difference]: With dead ends: 133 [2023-11-12 00:54:03,760 INFO L226 Difference]: Without dead ends: 133 [2023-11-12 00:54:03,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-11-12 00:54:03,761 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 130 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:03,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 305 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:54:03,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-12 00:54:03,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 114. [2023-11-12 00:54:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 112 states have internal predecessors, (123), 3 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-12 00:54:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2023-11-12 00:54:03,766 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 21 [2023-11-12 00:54:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:03,766 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2023-11-12 00:54:03,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2023-11-12 00:54:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:54:03,767 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:03,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:03,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 00:54:03,768 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:54:03,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:03,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1466124187, now seen corresponding path program 1 times [2023-11-12 00:54:03,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:03,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489986159] [2023-11-12 00:54:03,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:03,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:04,209 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-12 00:54:04,209 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:04,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489986159] [2023-11-12 00:54:04,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489986159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:04,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:04,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 00:54:04,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60829627] [2023-11-12 00:54:04,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:04,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 00:54:04,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:04,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 00:54:04,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:54:04,212 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:04,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:04,563 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2023-11-12 00:54:04,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 00:54:04,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-12 00:54:04,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:04,565 INFO L225 Difference]: With dead ends: 135 [2023-11-12 00:54:04,565 INFO L226 Difference]: Without dead ends: 135 [2023-11-12 00:54:04,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-12 00:54:04,566 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 134 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:04,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 161 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:54:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-12 00:54:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2023-11-12 00:54:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 117 states have internal predecessors, (129), 3 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-12 00:54:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2023-11-12 00:54:04,570 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 21 [2023-11-12 00:54:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:04,571 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2023-11-12 00:54:04,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2023-11-12 00:54:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:54:04,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:04,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:04,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-12 00:54:04,572 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:54:04,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:04,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1466124186, now seen corresponding path program 1 times [2023-11-12 00:54:04,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:04,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322939537] [2023-11-12 00:54:04,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:04,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:05,058 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-12 00:54:05,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:05,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322939537] [2023-11-12 00:54:05,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322939537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:05,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:05,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 00:54:05,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576048037] [2023-11-12 00:54:05,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:05,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 00:54:05,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:05,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 00:54:05,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:54:05,060 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:05,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:05,413 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2023-11-12 00:54:05,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:54:05,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-12 00:54:05,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:05,415 INFO L225 Difference]: With dead ends: 138 [2023-11-12 00:54:05,415 INFO L226 Difference]: Without dead ends: 138 [2023-11-12 00:54:05,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-12 00:54:05,416 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 48 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:05,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 240 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:54:05,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-12 00:54:05,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2023-11-12 00:54:05,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 117 states have internal predecessors, (128), 3 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-12 00:54:05,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2023-11-12 00:54:05,421 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 21 [2023-11-12 00:54:05,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:05,422 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2023-11-12 00:54:05,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:05,422 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2023-11-12 00:54:05,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 00:54:05,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:05,423 INFO L195 NwaCegarLoop]: trace histogram [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-12 00:54:05,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-12 00:54:05,424 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:54:05,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:05,424 INFO L85 PathProgramCache]: Analyzing trace with hash 559452283, now seen corresponding path program 1 times [2023-11-12 00:54:05,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:05,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086320666] [2023-11-12 00:54:05,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:05,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:06,114 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-12 00:54:06,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:06,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086320666] [2023-11-12 00:54:06,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086320666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:06,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:06,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-12 00:54:06,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431807721] [2023-11-12 00:54:06,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:06,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 00:54:06,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:06,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 00:54:06,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-11-12 00:54:06,117 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:06,461 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2023-11-12 00:54:06,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:54:06,462 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-12 00:54:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:06,463 INFO L225 Difference]: With dead ends: 137 [2023-11-12 00:54:06,463 INFO L226 Difference]: Without dead ends: 137 [2023-11-12 00:54:06,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-11-12 00:54:06,464 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 167 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:06,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 294 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:54:06,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-12 00:54:06,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 120. [2023-11-12 00:54:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 118 states have internal predecessors, (129), 3 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-12 00:54:06,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2023-11-12 00:54:06,468 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 25 [2023-11-12 00:54:06,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:06,468 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2023-11-12 00:54:06,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2023-11-12 00:54:06,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-12 00:54:06,469 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:06,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:06,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-12 00:54:06,470 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:54:06,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:06,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2076204185, now seen corresponding path program 1 times [2023-11-12 00:54:06,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:06,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006372665] [2023-11-12 00:54:06,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:06,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:06,557 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-12 00:54:06,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:06,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006372665] [2023-11-12 00:54:06,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006372665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:06,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:06,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:54:06,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363184929] [2023-11-12 00:54:06,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:06,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:54:06,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:06,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:54:06,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:54:06,560 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:06,685 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2023-11-12 00:54:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:54:06,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-12 00:54:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:06,687 INFO L225 Difference]: With dead ends: 131 [2023-11-12 00:54:06,687 INFO L226 Difference]: Without dead ends: 131 [2023-11-12 00:54:06,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:54:06,688 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 117 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:06,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 81 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:54:06,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-12 00:54:06,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2023-11-12 00:54:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 120 states have internal predecessors, (131), 3 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-12 00:54:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2023-11-12 00:54:06,692 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 29 [2023-11-12 00:54:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:06,693 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2023-11-12 00:54:06,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2023-11-12 00:54:06,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:54:06,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:06,694 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:06,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-12 00:54:06,694 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-12 00:54:06,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:06,695 INFO L85 PathProgramCache]: Analyzing trace with hash -782014452, now seen corresponding path program 1 times [2023-11-12 00:54:06,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:06,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310264965] [2023-11-12 00:54:06,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:06,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:54:07,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:07,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310264965] [2023-11-12 00:54:07,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310264965] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:54:07,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588608114] [2023-11-12 00:54:07,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:07,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:07,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:54:07,740 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:54:07,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973154c3-8f07-4b29-9b6f-e0524a0c9ebf/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:54:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:07,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-12 00:54:07,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:54:07,974 INFO L351 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-12 00:54:07,995 INFO L351 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-12 00:54:08,050 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:54:08,051 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-12 00:54:08,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:08,088 INFO L351 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 23 treesize of output 11 [2023-11-12 00:54:08,096 INFO L351 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-12 00:54:08,165 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-12 00:54:08,166 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-12 00:54:08,173 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-12 00:54:08,228 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-12 00:54:08,251 INFO L351 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-12 00:54:08,335 INFO L351 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-12 00:54:08,356 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-12 00:54:08,356 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-12 00:54:08,380 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-12 00:54:08,387 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:54:08,507 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-12 00:54:08,508 INFO L351 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2023-11-12 00:54:08,516 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-12 00:54:08,553 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-12 00:54:08,581 INFO L351 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-12 00:54:08,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:54:08,618 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:54:08,664 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_826 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2023-11-12 00:54:08,684 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_826 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2023-11-12 00:54:08,828 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:54:08,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-11-12 00:54:08,834 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2023-11-12 00:54:08,842 INFO L351 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 24 treesize of output 22 [2023-11-12 00:54:09,930 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:54:09,930 INFO L351 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 183 treesize of output 152 [2023-11-12 00:54:09,939 INFO L351 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 287 treesize of output 263 [2023-11-12 00:54:09,951 INFO L351 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 249 treesize of output 243 [2023-11-12 00:54:10,196 INFO L322 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2023-11-12 00:54:10,196 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 250 treesize of output 360 [2023-11-12 00:54:10,241 INFO L351 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 260 treesize of output 248 [2023-11-12 00:54:32,298 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse8 (forall ((v_prenex_16 Int)) (or (forall ((v_prenex_14 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_14)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) (= v_prenex_16 |c_ULTIMATE.start_main_~x~0#1.base|)))) (.cse16 (not .cse6)) (.cse5 (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse39 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse39 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))) (and (or (and (forall ((v_arrayElimCell_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int) (v_ArrVal_819 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= (select (select (store (store (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int) (v_ArrVal_819 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))) .cse5) .cse6) (or (forall ((v_prenex_16 Int) (v_prenex_14 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int))) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_14)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= v_prenex_16 |c_ULTIMATE.start_main_~x~0#1.base|))) .cse6) (or (and (forall ((v_prenex_16 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) (= v_prenex_16 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_14 Int) (v_arrayElimCell_27 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_14)))) (or (= v_prenex_16 v_arrayElimCell_27) (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_15) v_arrayElimCell_27 v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27)))))) .cse8) .cse6) (or .cse6 (and (forall ((v_prenex_16 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) (= v_prenex_16 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_14 Int) (v_arrayElimCell_27 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_14)))) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_15) v_arrayElimCell_27 v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27)))))) .cse8)) (or .cse6 (and (forall ((v_prenex_16 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) (= v_prenex_16 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_27 Int)) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_14 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_14)))) (or (= (select (select (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (forall ((v_prenex_15 (Array Int Int))) (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_15) v_arrayElimCell_27 v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27))))) .cse8)) (or (and (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)))) (or (= (select (select (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= (select (select (store (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse12 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse12 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))))) .cse5) .cse6) (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse14 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse14 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (or .cse16 (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20))))) (or .cse6 (and (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int) (v_ArrVal_819 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse18 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse19 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse18 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int) (v_ArrVal_819 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)))) (or (= (select (select (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))) .cse5)) (forall ((v_prenex_16 Int)) (or (forall ((v_arrayElimCell_27 Int)) (or (= v_prenex_16 v_arrayElimCell_27) (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_14 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_14)))) (or (= (select (select (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (forall ((v_prenex_15 (Array Int Int))) (= (select (select (store (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_15) v_arrayElimCell_27 v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) (= v_prenex_16 |c_ULTIMATE.start_main_~x~0#1.base|))) (or .cse6 .cse8) (or .cse6 (and (forall ((v_arrayElimCell_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)))) (or (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (forall ((v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_819 (Array Int Int))) (= (select (select (store (store (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))) .cse5 (forall ((v_arrayElimCell_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse23 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse23 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))))) (or (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse25 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse25 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= (select (select (store (store .cse25 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)))) .cse16) (or .cse6 (and (forall ((v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)))) (or (= (select (select (store (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (forall ((v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_819 (Array Int Int))) (= (select (select (store (store (store (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) .cse5 (forall ((v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse27 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse27 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_prenex_16 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) (= v_prenex_16 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_27 Int)) (or (= v_prenex_16 v_arrayElimCell_27) (forall ((v_prenex_14 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_14)))) (or (= (select (select (store (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (forall ((v_prenex_15 (Array Int Int))) (= (select (select (store (store (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_15) v_arrayElimCell_27 v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))))))) (or .cse6 (and (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)))) (let ((.cse30 (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse30 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse30 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)))) (or (= (select (select (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= (select (select (store (store (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|)))) .cse5)) (forall ((v_prenex_16 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) (forall ((v_prenex_14 Int) (v_arrayElimCell_27 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_14)))) (or (= v_prenex_16 v_arrayElimCell_27) (= (select (select (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_15) v_arrayElimCell_27 v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)))) (= v_prenex_16 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (and (forall ((v_arrayElimCell_20 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int)) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)))) (or (= (select (select (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (forall ((v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_819 (Array Int Int))) (= (select (select (store (store (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))) .cse5 (forall ((v_arrayElimCell_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)))) (let ((.cse35 (store .cse36 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822))) (or (= (select (select (store .cse35 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store (store .cse36 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse35 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|)))) .cse6) (or (forall ((v_prenex_16 Int) (v_prenex_14 Int) (v_arrayElimCell_27 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (= v_prenex_16 v_arrayElimCell_27) (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= v_prenex_16 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_14)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_15) v_arrayElimCell_27 v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))) .cse16) (or (forall ((v_prenex_16 Int) (v_prenex_14 Int) (v_arrayElimCell_27 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (= v_prenex_16 v_arrayElimCell_27) (= v_prenex_16 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_14)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_15) v_arrayElimCell_27 v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))) .cse16) (or .cse6 (and (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_815 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_815)))) (or (= (select (select (store (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= (select (select (store (store (store (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_819) v_arrayElimCell_20 v_ArrVal_822) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_825) v_arrayElimCell_18 v_ArrVal_826) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) .cse5)) (forall ((v_prenex_16 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) (= v_prenex_16 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_27 Int)) (or (= v_prenex_16 v_arrayElimCell_27) (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_14 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_prenex_14)))) (or (= (select (select (store (store .cse38 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (forall ((v_prenex_15 (Array Int Int))) (= (select (select (store (store (store .cse38 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_15) v_arrayElimCell_27 v_prenex_11) v_prenex_16 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27)))))))) is different from false