./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E --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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:25:22,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:25:22,658 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 05:25:22,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:25:22,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:25:22,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:25:22,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:25:22,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:25:22,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:25:22,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:25:22,709 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:25:22,710 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:25:22,710 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:25:22,710 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:25:22,710 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:25:22,710 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:25:22,710 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:25:22,711 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:25:22,711 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:25:22,711 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:25:22,712 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:25:22,712 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:25:22,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:25:22,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:25:22,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:25:22,713 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:25:22,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:25:22,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:25:22,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:25:22,714 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:25:22,714 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:25:22,714 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:25:22,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:25:22,714 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:25:22,715 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:25:22,715 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:25:22,715 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:25:22,716 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:25:22,716 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:25:22,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:25:22,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:25:22,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:25:22,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:25:22,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:25:22,717 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:25:22,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:25:22,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:25:22,717 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:25:22,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:25:22,717 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2024-11-14 05:25:23,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:25:23,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:25:23,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:25:23,051 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:25:23,052 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:25:23,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i Unable to find full path for "g++" [2024-11-14 05:25:24,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:25:25,434 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:25:25,436 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2024-11-14 05:25:25,450 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/data/8d57fc31d/2b3e3d35b85444c68cb974adfc65884d/FLAG75f372f70 [2024-11-14 05:25:25,558 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/data/8d57fc31d/2b3e3d35b85444c68cb974adfc65884d [2024-11-14 05:25:25,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:25:25,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:25:25,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:25:25,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:25:25,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:25:25,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:25:25" (1/1) ... [2024-11-14 05:25:25,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@414741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:25, skipping insertion in model container [2024-11-14 05:25:25,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:25:25" (1/1) ... [2024-11-14 05:25:25,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:25:25,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:25:25,945 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:25:26,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:25:26,067 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:25:26,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:26 WrapperNode [2024-11-14 05:25:26,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:25:26,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:25:26,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:25:26,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:25:26,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:26" (1/1) ... [2024-11-14 05:25:26,089 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:26" (1/1) ... [2024-11-14 05:25:26,112 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 122 [2024-11-14 05:25:26,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:25:26,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:25:26,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:25:26,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:25:26,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:26" (1/1) ... [2024-11-14 05:25:26,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:26" (1/1) ... [2024-11-14 05:25:26,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:26" (1/1) ... [2024-11-14 05:25:26,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:26" (1/1) ... [2024-11-14 05:25:26,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:26" (1/1) ... [2024-11-14 05:25:26,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:26" (1/1) ... [2024-11-14 05:25:26,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:26" (1/1) ... [2024-11-14 05:25:26,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:26" (1/1) ... [2024-11-14 05:25:26,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:25:26,145 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:25:26,146 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:25:26,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:25:26,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:26" (1/1) ... [2024-11-14 05:25:26,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:25:26,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:25:26,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:25:26,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:25:26,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:25:26,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:25:26,211 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 05:25:26,211 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 05:25:26,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:25:26,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:25:26,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 05:25:26,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:25:26,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:25:26,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:25:26,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 05:25:26,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:25:26,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:25:26,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:25:26,410 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:25:26,413 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:25:26,819 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-14 05:25:26,819 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:25:26,884 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:25:26,884 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-14 05:25:26,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:25:26 BoogieIcfgContainer [2024-11-14 05:25:26,884 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:25:26,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:25:26,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:25:26,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:25:26,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:25:25" (1/3) ... [2024-11-14 05:25:26,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c888b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:25:26, skipping insertion in model container [2024-11-14 05:25:26,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:26" (2/3) ... [2024-11-14 05:25:26,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c888b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:25:26, skipping insertion in model container [2024-11-14 05:25:26,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:25:26" (3/3) ... [2024-11-14 05:25:26,896 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2024-11-14 05:25:26,913 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:25:26,914 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_insert_equal.i that has 2 procedures, 69 locations, 1 initial locations, 4 loop locations, and 31 error locations. [2024-11-14 05:25:26,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:25:26,983 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@499d746b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:25:26,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2024-11-14 05:25:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 34 states have (on average 2.176470588235294) internal successors, (74), 65 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:25:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 05:25:26,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:27,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 05:25:27,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:25:27,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:27,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1158438303, now seen corresponding path program 1 times [2024-11-14 05:25:27,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:27,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877753771] [2024-11-14 05:25:27,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:27,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:27,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:27,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877753771] [2024-11-14 05:25:27,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877753771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:27,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:25:27,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:25:27,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475286983] [2024-11-14 05:25:27,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:27,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:25:27,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:27,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:25:27,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:25:27,455 INFO L87 Difference]: Start difference. First operand has 69 states, 34 states have (on average 2.176470588235294) internal successors, (74), 65 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (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) [2024-11-14 05:25:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:27,594 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-11-14 05:25:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:25:27,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (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 6 [2024-11-14 05:25:27,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:27,603 INFO L225 Difference]: With dead ends: 66 [2024-11-14 05:25:27,604 INFO L226 Difference]: Without dead ends: 64 [2024-11-14 05:25:27,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:25:27,607 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:27,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:25:27,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-14 05:25:27,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-14 05:25:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 32 states have (on average 2.0625) internal successors, (66), 60 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:25:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-11-14 05:25:27,642 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 6 [2024-11-14 05:25:27,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:27,642 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-11-14 05:25:27,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (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) [2024-11-14 05:25:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-11-14 05:25:27,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 05:25:27,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:27,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 05:25:27,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:25:27,643 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:25:27,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:27,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1158438302, now seen corresponding path program 1 times [2024-11-14 05:25:27,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:27,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896159642] [2024-11-14 05:25:27,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:27,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:27,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:27,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896159642] [2024-11-14 05:25:27,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896159642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:27,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:25:27,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:25:27,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576333960] [2024-11-14 05:25:27,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:27,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:25:27,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:27,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:25:27,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:25:27,755 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (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) [2024-11-14 05:25:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:27,849 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2024-11-14 05:25:27,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:25:27,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (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 6 [2024-11-14 05:25:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:27,851 INFO L225 Difference]: With dead ends: 62 [2024-11-14 05:25:27,851 INFO L226 Difference]: Without dead ends: 62 [2024-11-14 05:25:27,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:25:27,852 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:27,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 86 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:25:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-14 05:25:27,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-14 05:25:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 32 states have (on average 2.0) internal successors, (64), 58 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:25:27,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2024-11-14 05:25:27,859 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 6 [2024-11-14 05:25:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:27,859 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2024-11-14 05:25:27,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (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) [2024-11-14 05:25:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2024-11-14 05:25:27,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:25:27,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:27,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:27,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:25:27,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:25:27,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:27,861 INFO L85 PathProgramCache]: Analyzing trace with hash 109604144, now seen corresponding path program 1 times [2024-11-14 05:25:27,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:27,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810401730] [2024-11-14 05:25:27,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:27,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:28,059 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:28,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810401730] [2024-11-14 05:25:28,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810401730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:28,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:25:28,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:25:28,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492224745] [2024-11-14 05:25:28,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:28,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:25:28,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:28,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:25:28,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:25:28,061 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:25:28,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:28,263 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2024-11-14 05:25:28,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:25:28,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-14 05:25:28,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:28,265 INFO L225 Difference]: With dead ends: 61 [2024-11-14 05:25:28,265 INFO L226 Difference]: Without dead ends: 61 [2024-11-14 05:25:28,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:25:28,266 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:28,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 169 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:25:28,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-14 05:25:28,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-14 05:25:28,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 32 states have (on average 1.96875) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:25:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-11-14 05:25:28,278 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 10 [2024-11-14 05:25:28,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:28,279 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-11-14 05:25:28,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:25:28,279 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2024-11-14 05:25:28,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:25:28,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:28,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:28,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:25:28,280 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:25:28,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:28,280 INFO L85 PathProgramCache]: Analyzing trace with hash 109604145, now seen corresponding path program 1 times [2024-11-14 05:25:28,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:28,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789847842] [2024-11-14 05:25:28,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:28,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:28,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:28,563 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:28,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789847842] [2024-11-14 05:25:28,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789847842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:28,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:25:28,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:25:28,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708917430] [2024-11-14 05:25:28,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:28,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:25:28,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:28,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:25:28,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:25:28,564 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:25:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:28,733 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2024-11-14 05:25:28,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:25:28,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-14 05:25:28,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:28,736 INFO L225 Difference]: With dead ends: 60 [2024-11-14 05:25:28,736 INFO L226 Difference]: Without dead ends: 60 [2024-11-14 05:25:28,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:25:28,737 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:28,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:25:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-14 05:25:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-14 05:25:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 1.9375) internal successors, (62), 56 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:25:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2024-11-14 05:25:28,748 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 10 [2024-11-14 05:25:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:28,748 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2024-11-14 05:25:28,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:25:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2024-11-14 05:25:28,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:25:28,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:28,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:28,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:25:28,750 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:25:28,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:28,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1037925779, now seen corresponding path program 1 times [2024-11-14 05:25:28,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:28,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029581175] [2024-11-14 05:25:28,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:28,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:28,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:28,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:28,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029581175] [2024-11-14 05:25:28,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029581175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:28,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:25:28,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:25:28,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384138302] [2024-11-14 05:25:28,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:28,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:25:28,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:28,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:25:28,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:25:28,817 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:25:28,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:28,860 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2024-11-14 05:25:28,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:25:28,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-14 05:25:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:28,862 INFO L225 Difference]: With dead ends: 64 [2024-11-14 05:25:28,863 INFO L226 Difference]: Without dead ends: 64 [2024-11-14 05:25:28,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:25:28,863 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:28,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 102 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:25:28,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-14 05:25:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2024-11-14 05:25:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:25:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-11-14 05:25:28,874 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 10 [2024-11-14 05:25:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:28,874 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-11-14 05:25:28,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:25:28,875 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2024-11-14 05:25:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:25:28,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:28,875 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:28,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:25:28,876 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:25:28,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:28,876 INFO L85 PathProgramCache]: Analyzing trace with hash -137676405, now seen corresponding path program 1 times [2024-11-14 05:25:28,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:28,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686610875] [2024-11-14 05:25:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 05:25:29,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:29,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686610875] [2024-11-14 05:25:29,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686610875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:29,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068086362] [2024-11-14 05:25:29,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:29,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:29,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:25:29,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:25:29,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:25:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:29,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:25:29,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:25:29,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:25:29,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 05:25:29,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068086362] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:25:29,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1967567484] [2024-11-14 05:25:29,282 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-14 05:25:29,284 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:25:29,288 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:25:29,292 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:25:29,293 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:25:31,436 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2024-11-14 05:25:31,944 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:25:39,810 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '826#(and (exists ((|v_ULTIMATE.start_sll_insert_~head#1.base_19| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_19|) 1)) (or (and (exists ((|v_#length_67| (Array Int Int))) (= |#length| (store |v_#length_67| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.base_63| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#valid_82| (Array Int Int))) (and (= (store |v_#valid_82| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_82| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) (= |v_ULTIMATE.start_sll_insert_~head#1.base_19| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_BEFORE_CALL_17| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_48| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_48| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select (select |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_67| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_67| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_#length_BEFORE_CALL_17| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_10| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1))) (exists ((|v_#memory_int_44| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int)))) (and (= |v_#memory_int_45| (store |v_#memory_int_44| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_44| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_45| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_45| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_45| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 1))))) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_63| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0)))))) (and (exists ((|v_#length_67| (Array Int Int))) (= |#length| (store |v_#length_67| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.base_63| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#valid_82| (Array Int Int))) (and (= (store |v_#valid_82| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_82| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) (= |v_ULTIMATE.start_sll_insert_~head#1.base_19| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_44| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int)))) (and (= |v_#memory_int_45| (store |v_#memory_int_44| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_44| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_45| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_45| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_45| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 1))))) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_63| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_9| (Array Int Int))) (and (= (store |v_#memory_int_48| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_48| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_int)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_67| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_67| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_old(#length)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0))))))))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_insert_~data#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_insert_~index#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:25:39,810 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:25:39,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:25:39,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-14 05:25:39,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771277874] [2024-11-14 05:25:39,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:25:39,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:25:39,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:39,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:25:39,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=207, Unknown=1, NotChecked=0, Total=240 [2024-11-14 05:25:39,814 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:25:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:39,870 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-11-14 05:25:39,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:25:39,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-11-14 05:25:39,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:39,871 INFO L225 Difference]: With dead ends: 65 [2024-11-14 05:25:39,872 INFO L226 Difference]: Without dead ends: 65 [2024-11-14 05:25:39,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=32, Invalid=207, Unknown=1, NotChecked=0, Total=240 [2024-11-14 05:25:39,873 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:39,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 150 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:25:39,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-14 05:25:39,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-14 05:25:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 60 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:25:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2024-11-14 05:25:39,877 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 19 [2024-11-14 05:25:39,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:39,878 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2024-11-14 05:25:39,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:25:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-11-14 05:25:39,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:25:39,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:39,879 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:39,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:25:40,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:40,084 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:25:40,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:40,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1699050643, now seen corresponding path program 2 times [2024-11-14 05:25:40,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:40,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749554908] [2024-11-14 05:25:40,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:40,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:25:40,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:40,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749554908] [2024-11-14 05:25:40,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749554908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:40,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102773558] [2024-11-14 05:25:40,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:25:40,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:40,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:25:40,744 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:25:40,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:25:40,923 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:25:40,923 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:25:40,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 05:25:40,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:40,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:25:40,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:25:41,059 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:25:41,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 05:25:41,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:25:41,178 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-14 05:25:41,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:41,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:25:41,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:25:41,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:41,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:25:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 8 not checked. [2024-11-14 05:25:41,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:25:41,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102773558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:41,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1676968197] [2024-11-14 05:25:41,393 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-14 05:25:41,393 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:25:41,393 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:25:41,393 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:25:41,394 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:25:42,360 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2024-11-14 05:25:42,757 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:25:49,752 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1075#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_insert_~head#1.base_20| Int)) (and (or (and (exists ((|v_#valid_95| (Array Int Int))) (and (= (select |v_#valid_95| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_95| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|))) (exists ((|v_#length_74| (Array Int Int))) (= |#length| (store |v_#length_74| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (= |v_ULTIMATE.start_sll_insert_~head#1.base_20| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_#length_BEFORE_CALL_33| (Array Int Int)) (|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int))) (|v_#memory_int_60| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (and (<= 8 (select |v_#length_BEFORE_CALL_33| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_20| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (store |v_#memory_$Pointer$.base_79| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_79| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_int)_AFTER_CALL_20| (store |v_#memory_int_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_20| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (exists ((|v_#memory_int_56| (Array Int (Array Int Int))) (|v_#memory_int_57| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_57| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_57| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 1))) (= |v_#memory_int_57| (store |v_#memory_int_56| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_56| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_57| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))))))) (and (exists ((|v_#valid_95| (Array Int Int))) (and (= (select |v_#valid_95| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_95| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|))) (exists ((|v_#length_74| (Array Int Int))) (= |#length| (store |v_#length_74| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (= |v_ULTIMATE.start_sll_insert_~head#1.base_20| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_35| (Array Int Int)) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int))) (|v_#memory_int_60| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_21| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_21| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (store |v_#memory_$Pointer$.base_79| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_79| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select (select |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_#length_BEFORE_CALL_35| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |v_old(#memory_int)_AFTER_CALL_21| (store |v_#memory_int_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_21| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (exists ((|v_#memory_int_56| (Array Int (Array Int Int))) (|v_#memory_int_57| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_57| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_57| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 1))) (= |v_#memory_int_57| (store |v_#memory_int_56| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_56| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_57| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4)))))))) (not (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_20|) 1)))) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_insert_~data#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_insert_~index#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:25:49,752 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:25:49,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:25:49,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2024-11-14 05:25:49,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874791740] [2024-11-14 05:25:49,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:25:49,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 05:25:49,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:49,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 05:25:49,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=670, Unknown=2, NotChecked=52, Total=812 [2024-11-14 05:25:49,754 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 16 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 05:25:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:50,225 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2024-11-14 05:25:50,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:25:50,225 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2024-11-14 05:25:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:50,226 INFO L225 Difference]: With dead ends: 74 [2024-11-14 05:25:50,226 INFO L226 Difference]: Without dead ends: 74 [2024-11-14 05:25:50,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=114, Invalid=818, Unknown=2, NotChecked=58, Total=992 [2024-11-14 05:25:50,228 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 208 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:50,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 154 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 267 Invalid, 0 Unknown, 72 Unchecked, 0.3s Time] [2024-11-14 05:25:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-14 05:25:50,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2024-11-14 05:25:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 56 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:25:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-11-14 05:25:50,239 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 28 [2024-11-14 05:25:50,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:50,239 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-11-14 05:25:50,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 05:25:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-11-14 05:25:50,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:25:50,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:50,240 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:50,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 05:25:50,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:50,441 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:25:50,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1699050644, now seen corresponding path program 1 times [2024-11-14 05:25:50,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:50,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984143436] [2024-11-14 05:25:50,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:50,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:25:51,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:51,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984143436] [2024-11-14 05:25:51,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984143436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:51,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836543011] [2024-11-14 05:25:51,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:51,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:51,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:25:51,427 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:25:51,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:25:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:51,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 05:25:51,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:51,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:25:51,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:25:51,603 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-14 05:25:51,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:51,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:25:51,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:25:51,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:51,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:25:51,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:25:51,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:51,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:25:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 05:25:51,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:25:51,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836543011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:51,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:25:51,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 13 [2024-11-14 05:25:51,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113161608] [2024-11-14 05:25:51,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:51,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:25:51,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:51,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:25:51,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=144, Unknown=1, NotChecked=24, Total=210 [2024-11-14 05:25:51,764 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:25:51,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:51,874 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2024-11-14 05:25:51,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:25:51,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-14 05:25:51,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:51,875 INFO L225 Difference]: With dead ends: 62 [2024-11-14 05:25:51,876 INFO L226 Difference]: Without dead ends: 62 [2024-11-14 05:25:51,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=167, Unknown=1, NotChecked=26, Total=240 [2024-11-14 05:25:51,876 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:51,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 122 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 81 Unchecked, 0.1s Time] [2024-11-14 05:25:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-14 05:25:51,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2024-11-14 05:25:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 54 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:25:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-11-14 05:25:51,882 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 28 [2024-11-14 05:25:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:51,882 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-11-14 05:25:51,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:25:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-11-14 05:25:51,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 05:25:51,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:51,884 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:51,898 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 05:25:52,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:52,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:25:52,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:52,088 INFO L85 PathProgramCache]: Analyzing trace with hash 700225371, now seen corresponding path program 1 times [2024-11-14 05:25:52,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:52,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487368433] [2024-11-14 05:25:52,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:52,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 05:25:52,710 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:52,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487368433] [2024-11-14 05:25:52,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487368433] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:52,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394138260] [2024-11-14 05:25:52,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:52,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:52,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:25:52,713 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:25:52,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 05:25:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:53,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 05:25:53,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:53,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-14 05:25:53,208 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_34| Int)) (and (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_34| 1)) (<= (+ |v_node_create_~temp~0#1.base_34| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_34| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_34|)) |c_#memory_$Pointer$.base|))) is different from true [2024-11-14 05:25:53,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:53,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 05:25:53,229 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 05:25:53,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-14 05:25:53,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 05:25:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 05:25:53,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:25:53,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394138260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:25:53,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:25:53,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2024-11-14 05:25:53,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597172582] [2024-11-14 05:25:53,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:25:53,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:25:53,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:25:53,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:25:53,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=326, Unknown=1, NotChecked=36, Total=420 [2024-11-14 05:25:53,314 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 11 states, 8 states have (on average 2.25) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:25:53,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:25:53,569 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2024-11-14 05:25:53,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:25:53,570 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-14 05:25:53,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:25:53,570 INFO L225 Difference]: With dead ends: 69 [2024-11-14 05:25:53,570 INFO L226 Difference]: Without dead ends: 69 [2024-11-14 05:25:53,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=396, Unknown=1, NotChecked=40, Total=506 [2024-11-14 05:25:53,571 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:25:53,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 212 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 245 Invalid, 0 Unknown, 99 Unchecked, 0.2s Time] [2024-11-14 05:25:53,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-14 05:25:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2024-11-14 05:25:53,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 56 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:25:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2024-11-14 05:25:53,576 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 30 [2024-11-14 05:25:53,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:25:53,576 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2024-11-14 05:25:53,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:25:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2024-11-14 05:25:53,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 05:25:53,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:25:53,577 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:25:53,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 05:25:53,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:53,777 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:25:53,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:25:53,777 INFO L85 PathProgramCache]: Analyzing trace with hash 700225372, now seen corresponding path program 1 times [2024-11-14 05:25:53,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:25:53,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760128011] [2024-11-14 05:25:53,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:53,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:25:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:25:54,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:25:54,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760128011] [2024-11-14 05:25:54,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760128011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:54,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714639859] [2024-11-14 05:25:54,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:25:54,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:25:54,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:25:54,866 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:25:54,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 05:25:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:25:55,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-14 05:25:55,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:25:55,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:25:55,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-14 05:25:55,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:25:55,727 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_36| Int)) (and (<= (+ |v_node_create_~temp~0#1.base_36| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_36| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_36|)) |c_#memory_$Pointer$.offset|) (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_36| (select |c_#length| |v_node_create_~temp~0#1.base_36|)) |c_#length|) (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_36| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_36|)) |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_36|) 0))) is different from true [2024-11-14 05:25:55,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:55,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:25:55,759 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 05:25:55,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-14 05:25:55,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 05:25:55,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:25:55,775 INFO L378 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 [2024-11-14 05:25:55,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 05:25:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2024-11-14 05:25:55,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:25:56,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714639859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:25:56,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1408058678] [2024-11-14 05:25:56,149 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 05:25:56,149 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:25:56,150 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:25:56,150 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:25:56,150 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:25:57,106 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2024-11-14 05:25:57,439 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:26:06,435 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1820#(and (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) 0)) (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 8)) (< (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) 0)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~head#1.base|) 0) |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|) (<= 4 (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|)) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_insert_~data#1| 1) (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (or (and (exists ((|v_#memory_$Pointer$.base_93| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_93| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_93| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#length_89| (Array Int Int))) (= |#length| (store |v_#length_89| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_old(#memory_int)_AFTER_CALL_37| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_37| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_37| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int)) (|v_#memory_int_72| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_37| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (<= 8 (select |v_old(#length)_AFTER_CALL_37| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select (select |v_#memory_$Pointer$.offset_95| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| (store |v_#memory_$Pointer$.base_97| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_97| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_int)_AFTER_CALL_37| (store |v_#memory_int_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_37| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (exists ((|v_#valid_105| (Array Int Int))) (and (= (select |v_#valid_105| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_105| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|))) (= |ULTIMATE.start_sll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_68| (Array Int (Array Int Int))) (|v_#memory_int_69| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_68| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_68| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_69| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_69|) (= |#memory_int| (store |v_#memory_int_69| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_69| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 1))))) (exists ((|v_#memory_$Pointer$.offset_91| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_91| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_91| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0)))))) (and (exists ((|v_#memory_$Pointer$.base_93| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_93| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_93| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#length_89| (Array Int Int))) (= |#length| (store |v_#length_89| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_38| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_38| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_38| (Array Int (Array Int Int))) (|v_#memory_int_72| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| (store |v_#memory_$Pointer$.base_97| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_97| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_old(#length)_AFTER_CALL_38| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select (select |v_#memory_$Pointer$.offset_95| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_38| (store |v_#memory_int_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_38| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_old(#valid)_AFTER_CALL_38| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1))) (exists ((|v_#valid_105| (Array Int Int))) (and (= (select |v_#valid_105| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_105| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|))) (= |ULTIMATE.start_sll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_68| (Array Int (Array Int Int))) (|v_#memory_int_69| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_68| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_68| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_69| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_69|) (= |#memory_int| (store |v_#memory_int_69| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_69| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 1))))) (exists ((|v_#memory_$Pointer$.offset_91| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_91| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_91| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))))) (= |ULTIMATE.start_sll_insert_~index#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) 0) |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:26:06,435 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:26:06,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:26:06,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2024-11-14 05:26:06,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556951179] [2024-11-14 05:26:06,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:06,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 05:26:06,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:06,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 05:26:06,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1593, Unknown=2, NotChecked=80, Total=1806 [2024-11-14 05:26:06,438 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 26 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 23 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 05:26:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:07,722 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2024-11-14 05:26:07,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 05:26:07,722 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 23 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2024-11-14 05:26:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:07,723 INFO L225 Difference]: With dead ends: 69 [2024-11-14 05:26:07,723 INFO L226 Difference]: Without dead ends: 69 [2024-11-14 05:26:07,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=211, Invalid=2443, Unknown=2, NotChecked=100, Total=2756 [2024-11-14 05:26:07,725 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 102 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:07,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 383 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 686 Invalid, 0 Unknown, 74 Unchecked, 0.6s Time] [2024-11-14 05:26:07,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-14 05:26:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2024-11-14 05:26:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 56 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:26:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2024-11-14 05:26:07,729 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 30 [2024-11-14 05:26:07,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:07,729 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2024-11-14 05:26:07,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 23 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 05:26:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2024-11-14 05:26:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 05:26:07,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:07,730 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:07,750 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 05:26:07,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 05:26:07,931 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:26:07,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:07,932 INFO L85 PathProgramCache]: Analyzing trace with hash 232279091, now seen corresponding path program 1 times [2024-11-14 05:26:07,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:07,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116093198] [2024-11-14 05:26:07,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:07,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 05:26:08,007 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:08,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116093198] [2024-11-14 05:26:08,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116093198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:26:08,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:26:08,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:26:08,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956430835] [2024-11-14 05:26:08,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:26:08,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:26:08,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:08,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:26:08,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:26:08,008 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:26:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:08,056 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-11-14 05:26:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:26:08,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-14 05:26:08,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:08,057 INFO L225 Difference]: With dead ends: 62 [2024-11-14 05:26:08,057 INFO L226 Difference]: Without dead ends: 62 [2024-11-14 05:26:08,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:26:08,058 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:08,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:26:08,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-14 05:26:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-14 05:26:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.641025641025641) internal successors, (64), 57 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:26:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2024-11-14 05:26:08,066 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 31 [2024-11-14 05:26:08,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:08,066 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-14 05:26:08,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:26:08,066 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2024-11-14 05:26:08,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:26:08,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:08,067 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:08,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 05:26:08,067 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:26:08,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:08,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1393170350, now seen corresponding path program 1 times [2024-11-14 05:26:08,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:08,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095889398] [2024-11-14 05:26:08,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:08,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 05:26:08,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:08,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095889398] [2024-11-14 05:26:08,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095889398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:26:08,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:26:08,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:26:08,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783797793] [2024-11-14 05:26:08,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:26:08,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:26:08,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:08,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:26:08,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:26:08,206 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:26:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:08,262 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2024-11-14 05:26:08,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:26:08,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-14 05:26:08,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:08,263 INFO L225 Difference]: With dead ends: 63 [2024-11-14 05:26:08,264 INFO L226 Difference]: Without dead ends: 63 [2024-11-14 05:26:08,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:26:08,264 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 30 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:08,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 106 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:26:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-14 05:26:08,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2024-11-14 05:26:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 54 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:26:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-11-14 05:26:08,270 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 32 [2024-11-14 05:26:08,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:08,270 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-11-14 05:26:08,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:26:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-11-14 05:26:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:26:08,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:08,271 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:08,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 05:26:08,271 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:26:08,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:08,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1389277785, now seen corresponding path program 1 times [2024-11-14 05:26:08,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:08,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352093185] [2024-11-14 05:26:08,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:08,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-14 05:26:08,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:08,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352093185] [2024-11-14 05:26:08,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352093185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:26:08,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:26:08,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:26:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530583955] [2024-11-14 05:26:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:26:08,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:26:08,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:08,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:26:08,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:26:08,389 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:26:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:08,505 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2024-11-14 05:26:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:26:08,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-14 05:26:08,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:08,506 INFO L225 Difference]: With dead ends: 58 [2024-11-14 05:26:08,506 INFO L226 Difference]: Without dead ends: 58 [2024-11-14 05:26:08,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:26:08,507 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:08,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:26:08,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-14 05:26:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-14 05:26:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 53 states have internal predecessors, (59), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:26:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2024-11-14 05:26:08,514 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 32 [2024-11-14 05:26:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:08,516 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2024-11-14 05:26:08,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:26:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2024-11-14 05:26:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:26:08,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:08,519 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:08,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 05:26:08,520 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:26:08,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:08,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1389277784, now seen corresponding path program 1 times [2024-11-14 05:26:08,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:08,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36463409] [2024-11-14 05:26:08,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:08,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 05:26:08,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:08,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36463409] [2024-11-14 05:26:08,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36463409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:26:08,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:26:08,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:26:08,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007712118] [2024-11-14 05:26:08,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:26:08,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:26:08,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:08,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:26:08,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:26:08,620 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:26:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:08,666 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2024-11-14 05:26:08,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:26:08,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-14 05:26:08,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:08,667 INFO L225 Difference]: With dead ends: 61 [2024-11-14 05:26:08,667 INFO L226 Difference]: Without dead ends: 61 [2024-11-14 05:26:08,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:26:08,668 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 30 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:08,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 103 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:26:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-14 05:26:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-14 05:26:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 52 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:26:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-11-14 05:26:08,672 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 32 [2024-11-14 05:26:08,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:08,672 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-11-14 05:26:08,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:26:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2024-11-14 05:26:08,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:26:08,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:08,673 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:08,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 05:26:08,673 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:26:08,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:08,674 INFO L85 PathProgramCache]: Analyzing trace with hash -238478820, now seen corresponding path program 1 times [2024-11-14 05:26:08,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:08,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002085256] [2024-11-14 05:26:08,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:08,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 05:26:08,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:08,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002085256] [2024-11-14 05:26:08,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002085256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:26:08,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:26:08,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:26:08,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890762084] [2024-11-14 05:26:08,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:26:08,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:26:08,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:08,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:26:08,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:26:08,752 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:26:08,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:08,827 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-11-14 05:26:08,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:26:08,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-14 05:26:08,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:08,829 INFO L225 Difference]: With dead ends: 56 [2024-11-14 05:26:08,829 INFO L226 Difference]: Without dead ends: 56 [2024-11-14 05:26:08,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:26:08,830 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:08,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:26:08,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-14 05:26:08,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-14 05:26:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:26:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-11-14 05:26:08,834 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 33 [2024-11-14 05:26:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:08,835 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-14 05:26:08,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:26:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-11-14 05:26:08,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:26:08,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:08,835 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:08,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 05:26:08,835 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:26:08,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:08,838 INFO L85 PathProgramCache]: Analyzing trace with hash -238478819, now seen corresponding path program 1 times [2024-11-14 05:26:08,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:08,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840381127] [2024-11-14 05:26:08,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:08,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:26:09,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:09,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840381127] [2024-11-14 05:26:09,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840381127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:09,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295226388] [2024-11-14 05:26:09,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:09,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:09,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:09,363 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:09,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 05:26:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:09,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 05:26:09,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:09,982 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_46| Int)) (and (<= (+ |v_node_create_~temp~0#1.base_46| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_46| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_46|))))) is different from true [2024-11-14 05:26:09,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:26:10,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:26:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 05:26:10,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:26:10,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295226388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:26:10,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:26:10,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16] total 25 [2024-11-14 05:26:10,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072090556] [2024-11-14 05:26:10,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:26:10,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:26:10,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:10,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:26:10,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=539, Unknown=1, NotChecked=46, Total=650 [2024-11-14 05:26:10,094 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 11 states, 8 states have (on average 2.5) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:26:10,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:10,317 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-11-14 05:26:10,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:26:10,318 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.5) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-14 05:26:10,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:10,318 INFO L225 Difference]: With dead ends: 57 [2024-11-14 05:26:10,318 INFO L226 Difference]: Without dead ends: 57 [2024-11-14 05:26:10,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=681, Unknown=1, NotChecked=52, Total=812 [2024-11-14 05:26:10,319 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 9 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:10,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 208 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 72 Unchecked, 0.2s Time] [2024-11-14 05:26:10,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-14 05:26:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-11-14 05:26:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 50 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:26:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-11-14 05:26:10,323 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 33 [2024-11-14 05:26:10,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:10,323 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-14 05:26:10,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.5) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:26:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2024-11-14 05:26:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:26:10,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:10,326 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:10,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 05:26:10,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-14 05:26:10,527 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:26:10,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:10,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1197096159, now seen corresponding path program 1 times [2024-11-14 05:26:10,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:10,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210464685] [2024-11-14 05:26:10,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:10,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 05:26:10,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:10,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210464685] [2024-11-14 05:26:10,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210464685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:26:10,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:26:10,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:26:10,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511723234] [2024-11-14 05:26:10,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:26:10,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:26:10,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:10,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:26:10,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:26:10,748 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:26:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:10,903 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-11-14 05:26:10,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:26:10,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-14 05:26:10,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:10,906 INFO L225 Difference]: With dead ends: 54 [2024-11-14 05:26:10,906 INFO L226 Difference]: Without dead ends: 54 [2024-11-14 05:26:10,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:26:10,907 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:10,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 136 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:26:10,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-14 05:26:10,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-14 05:26:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:26:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2024-11-14 05:26:10,916 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 34 [2024-11-14 05:26:10,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:10,916 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2024-11-14 05:26:10,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:26:10,916 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2024-11-14 05:26:10,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 05:26:10,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:10,917 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:10,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 05:26:10,917 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:26:10,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:10,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1544721355, now seen corresponding path program 1 times [2024-11-14 05:26:10,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:10,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763385349] [2024-11-14 05:26:10,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:10,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 05:26:11,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:11,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763385349] [2024-11-14 05:26:11,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763385349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:26:11,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:26:11,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:26:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353749583] [2024-11-14 05:26:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:26:11,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:26:11,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:11,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:26:11,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:26:11,350 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:26:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:11,454 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2024-11-14 05:26:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:26:11,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-14 05:26:11,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:11,455 INFO L225 Difference]: With dead ends: 53 [2024-11-14 05:26:11,455 INFO L226 Difference]: Without dead ends: 53 [2024-11-14 05:26:11,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:26:11,456 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 29 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:11,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 112 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:26:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-14 05:26:11,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-11-14 05:26:11,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:26:11,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2024-11-14 05:26:11,461 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 35 [2024-11-14 05:26:11,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:11,461 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2024-11-14 05:26:11,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:26:11,461 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-11-14 05:26:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 05:26:11,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:11,464 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:11,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 05:26:11,464 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:26:11,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:11,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1581560667, now seen corresponding path program 1 times [2024-11-14 05:26:11,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:11,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243805996] [2024-11-14 05:26:11,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:11,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 05:26:11,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:11,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243805996] [2024-11-14 05:26:11,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243805996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:11,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919288208] [2024-11-14 05:26:11,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:11,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:11,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:11,784 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:11,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 05:26:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:12,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 05:26:12,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:12,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-14 05:26:12,240 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_48| Int)) (and (<= (+ |v_node_create_~temp~0#1.base_48| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_48| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_48|)) |c_#memory_$Pointer$.base|))) is different from true [2024-11-14 05:26:12,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:12,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-14 05:26:12,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-14 05:26:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2024-11-14 05:26:12,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:12,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919288208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:12,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [840282690] [2024-11-14 05:26:12,387 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 05:26:12,387 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:26:12,387 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:26:12,387 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:26:12,388 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:26:13,401 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 136 for LOIs [2024-11-14 05:26:13,739 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:26:24,644 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3238#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (exists ((|v_#memory_int_87| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~head#1.base_22| Int) (|v_#memory_int_88| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_118| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_110| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22| Int)) (and (<= 4 (select |#length| |v_ULTIMATE.start_sll_insert_~head#1.base_22|)) (= |#memory_int| (store |v_#memory_int_88| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22| (store (select |v_#memory_int_88| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|) 4 (select (select |#memory_int| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|) 4)))) (= (store (store |v_#memory_$Pointer$.base_118| |v_ULTIMATE.start_sll_insert_~head#1.base_22| (store (select |v_#memory_$Pointer$.base_118| |v_ULTIMATE.start_sll_insert_~head#1.base_22|) 0 |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|)) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22| (store (select (store |v_#memory_$Pointer$.base_118| |v_ULTIMATE.start_sll_insert_~head#1.base_22| (store (select |v_#memory_$Pointer$.base_118| |v_ULTIMATE.start_sll_insert_~head#1.base_22|) 0 |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|)) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|) 4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|) 4))) |#memory_$Pointer$.base|) (= (select |#valid| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|) 1) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_insert_~head#1.base_22| (store (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_insert_~head#1.base_22|) 0 0)) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22| (store (select (store |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_insert_~head#1.base_22| (store (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_sll_insert_~head#1.base_22|) 0 0)) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|) 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|) 4)))) (= (store |v_#memory_int_87| |v_ULTIMATE.start_sll_insert_~head#1.base_22| (store (select |v_#memory_int_87| |v_ULTIMATE.start_sll_insert_~head#1.base_22|) 0 (select (select |v_#memory_int_88| |v_ULTIMATE.start_sll_insert_~head#1.base_22|) 0))) |v_#memory_int_88|) (<= 8 (select |#length| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_22|)) (<= 2 |v_ULTIMATE.start_sll_insert_~head#1.base_22|) (= (select |#valid| |v_ULTIMATE.start_sll_insert_~head#1.base_22|) 1))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1)))' at error location [2024-11-14 05:26:24,644 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:26:24,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:26:24,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16] total 21 [2024-11-14 05:26:24,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389185765] [2024-11-14 05:26:24,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:26:24,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 05:26:24,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:26:24,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 05:26:24,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1521, Unknown=8, NotChecked=78, Total=1722 [2024-11-14 05:26:24,647 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 21 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-14 05:26:25,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:26:25,798 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-11-14 05:26:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:26:25,799 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2024-11-14 05:26:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:26:25,800 INFO L225 Difference]: With dead ends: 51 [2024-11-14 05:26:25,800 INFO L226 Difference]: Without dead ends: 51 [2024-11-14 05:26:25,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=237, Invalid=2729, Unknown=8, NotChecked=106, Total=3080 [2024-11-14 05:26:25,800 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 79 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:26:25,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 298 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 525 Invalid, 0 Unknown, 54 Unchecked, 0.4s Time] [2024-11-14 05:26:25,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-14 05:26:25,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-14 05:26:25,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:26:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-11-14 05:26:25,803 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 37 [2024-11-14 05:26:25,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:26:25,803 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-11-14 05:26:25,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-14 05:26:25,804 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-11-14 05:26:25,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 05:26:25,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:26:25,804 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:26:25,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 05:26:26,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:26,005 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:26:26,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:26:26,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1433797307, now seen corresponding path program 1 times [2024-11-14 05:26:26,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:26:26,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979954231] [2024-11-14 05:26:26,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:26,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:26:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:26:26,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:26:26,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979954231] [2024-11-14 05:26:26,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979954231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:26,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446869350] [2024-11-14 05:26:26,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:26:26,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:26:26,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:26:26,763 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:26:26,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 05:26:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:26:26,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-14 05:26:26,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:26:26,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:26:27,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-14 05:26:27,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:27,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 05:26:27,440 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-14 05:26:27,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-14 05:26:27,605 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2024-11-14 05:26:27,605 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2024-11-14 05:26:27,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:26:27,716 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:26:27,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 36 [2024-11-14 05:26:27,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:26:27,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-14 05:26:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:26:27,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:26:46,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446869350] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:26:46,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1477164771] [2024-11-14 05:26:46,339 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 05:26:46,339 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:26:46,339 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:26:46,339 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:26:46,339 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:26:47,358 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 136 for LOIs [2024-11-14 05:26:47,652 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:27:00,638 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3572#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_140| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~new_node~0#1.base_25| Int) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_35| Int) (|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_104| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_33| Int)) (and (<= 8 (select |#length| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_25|)) (= (store (store |v_#memory_$Pointer$.base_140| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_35| (store (select |v_#memory_$Pointer$.base_140| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_35|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_33| 4) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_25|)) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_25| (store (select (store |v_#memory_$Pointer$.base_140| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_35| (store (select |v_#memory_$Pointer$.base_140| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_35|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_33| 4) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_25|)) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_25|) 4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_25|) 4))) |#memory_$Pointer$.base|) (or (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_33| 0)) (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_35| 0))) (= (select |#valid| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_25|) 1) (<= 0 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_33| 4)) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_35| (store (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_35|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_33| 4) 0)) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_25| (store (select (store |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_35| (store (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_35|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_33| 4) 0)) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_25|) 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_25|) 4)))) (= (store |v_#memory_int_103| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_35| (store (select |v_#memory_int_103| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_35|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_33| 4) (select (select |v_#memory_int_104| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_35|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_33| 4)))) |v_#memory_int_104|) (= |#memory_int| (store |v_#memory_int_104| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_25| (store (select |v_#memory_int_104| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_25|) 4 (select (select |#memory_int| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_25|) 4)))) (= (select |#valid| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_35|) 1) (<= (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_33| 8) (select |#length| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_35|)))) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1)))' at error location [2024-11-14 05:27:00,638 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:27:00,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:27:00,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 34 [2024-11-14 05:27:00,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335768654] [2024-11-14 05:27:00,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:27:00,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-14 05:27:00,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:27:00,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-14 05:27:00,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3204, Unknown=34, NotChecked=0, Total=3422 [2024-11-14 05:27:00,640 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 35 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-14 05:27:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:27:04,302 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2024-11-14 05:27:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 05:27:04,303 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2024-11-14 05:27:04,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:27:04,303 INFO L225 Difference]: With dead ends: 52 [2024-11-14 05:27:04,303 INFO L226 Difference]: Without dead ends: 52 [2024-11-14 05:27:04,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1402 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=368, Invalid=5295, Unknown=37, NotChecked=0, Total=5700 [2024-11-14 05:27:04,305 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 119 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:27:04,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 372 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:27:04,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-14 05:27:04,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-14 05:27:04,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 47 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:27:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2024-11-14 05:27:04,309 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 37 [2024-11-14 05:27:04,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:27:04,309 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2024-11-14 05:27:04,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-14 05:27:04,309 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2024-11-14 05:27:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 05:27:04,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:27:04,310 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:27:04,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 05:27:04,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:04,511 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:27:04,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:27:04,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1433797308, now seen corresponding path program 1 times [2024-11-14 05:27:04,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:27:04,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972808230] [2024-11-14 05:27:04,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:04,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:27:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:27:06,166 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:27:06,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972808230] [2024-11-14 05:27:06,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972808230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:27:06,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090519140] [2024-11-14 05:27:06,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:06,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:06,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:27:06,168 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:27:06,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 05:27:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:06,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-14 05:27:06,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:27:06,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:27:06,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-14 05:27:06,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:27:06,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:06,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:27:06,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:06,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 05:27:06,992 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-14 05:27:06,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-14 05:27:07,209 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2024-11-14 05:27:07,210 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2024-11-14 05:27:07,234 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-14 05:27:07,234 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-14 05:27:07,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:07,390 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:27:07,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 51 [2024-11-14 05:27:07,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:07,410 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 05:27:07,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 58 [2024-11-14 05:27:07,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:27:07,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2024-11-14 05:27:07,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:27:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:27:07,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:27:07,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090519140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:27:07,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:27:07,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [21] total 35 [2024-11-14 05:27:07,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542825766] [2024-11-14 05:27:07,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:27:07,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 05:27:07,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:27:07,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 05:27:07,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1145, Unknown=0, NotChecked=0, Total=1260 [2024-11-14 05:27:07,693 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 18 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:27:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:27:08,386 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2024-11-14 05:27:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 05:27:08,387 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-14 05:27:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:27:08,387 INFO L225 Difference]: With dead ends: 53 [2024-11-14 05:27:08,387 INFO L226 Difference]: Without dead ends: 53 [2024-11-14 05:27:08,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=167, Invalid=1639, Unknown=0, NotChecked=0, Total=1806 [2024-11-14 05:27:08,388 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 85 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:27:08,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 239 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:27:08,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-14 05:27:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-14 05:27:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.358974358974359) internal successors, (53), 48 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:27:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-11-14 05:27:08,391 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 37 [2024-11-14 05:27:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:27:08,391 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-11-14 05:27:08,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:27:08,391 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2024-11-14 05:27:08,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 05:27:08,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:27:08,392 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:27:08,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 05:27:08,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:08,593 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:27:08,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:27:08,593 INFO L85 PathProgramCache]: Analyzing trace with hash 897838673, now seen corresponding path program 1 times [2024-11-14 05:27:08,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:27:08,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733564423] [2024-11-14 05:27:08,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:08,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:27:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:27:09,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:27:09,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733564423] [2024-11-14 05:27:09,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733564423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:27:09,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252018904] [2024-11-14 05:27:09,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:09,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:09,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:27:09,365 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:27:09,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 05:27:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:09,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 05:27:09,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:27:09,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-14 05:27:09,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:09,937 INFO L378 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 17 treesize of output 12 [2024-11-14 05:27:10,069 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2024-11-14 05:27:10,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2024-11-14 05:27:10,152 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-14 05:27:10,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 56 [2024-11-14 05:27:10,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-14 05:27:10,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-14 05:27:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:27:10,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:27:10,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252018904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:27:10,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:27:10,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [20] total 32 [2024-11-14 05:27:10,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463905020] [2024-11-14 05:27:10,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:27:10,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 05:27:10,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:27:10,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 05:27:10,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2024-11-14 05:27:10,170 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 18 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:27:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:27:10,641 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2024-11-14 05:27:10,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:27:10,645 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-14 05:27:10,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:27:10,646 INFO L225 Difference]: With dead ends: 53 [2024-11-14 05:27:10,646 INFO L226 Difference]: Without dead ends: 53 [2024-11-14 05:27:10,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=1263, Unknown=0, NotChecked=0, Total=1406 [2024-11-14 05:27:10,648 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:27:10,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 278 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:27:10,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-14 05:27:10,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-14 05:27:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:27:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2024-11-14 05:27:10,652 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 40 [2024-11-14 05:27:10,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:27:10,652 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2024-11-14 05:27:10,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:27:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2024-11-14 05:27:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 05:27:10,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:27:10,653 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:27:10,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 05:27:10,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:10,854 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-14 05:27:10,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:27:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash -710536969, now seen corresponding path program 1 times [2024-11-14 05:27:10,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:27:10,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218937458] [2024-11-14 05:27:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:27:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:27:12,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:27:12,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218937458] [2024-11-14 05:27:12,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218937458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:27:12,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923320868] [2024-11-14 05:27:12,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:27:12,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:27:12,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:27:12,233 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:27:12,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26e33548-c4d1-496f-b879-be7d2f0457c3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 05:27:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:27:12,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-11-14 05:27:12,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:27:12,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:27:12,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-14 05:27:12,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-14 05:27:12,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2024-11-14 05:27:12,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:12,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:27:12,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-14 05:27:12,987 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:27:12,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 05:27:13,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:13,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:27:13,186 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-14 05:27:13,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2024-11-14 05:27:13,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:27:13,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:27:13,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 24 [2024-11-14 05:27:13,648 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-14 05:27:13,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-14 05:27:13,652 INFO L378 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 7 treesize of output 3 [2024-11-14 05:27:13,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-14 05:27:14,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:14,016 INFO L378 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 [2024-11-14 05:27:14,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:14,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 05:27:14,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:14,040 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 05:27:14,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 45 [2024-11-14 05:27:14,112 INFO L349 Elim1Store]: treesize reduction 152, result has 22.4 percent of original size [2024-11-14 05:27:14,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 41 treesize of output 56 [2024-11-14 05:27:14,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:15,084 INFO L349 Elim1Store]: treesize reduction 70, result has 51.4 percent of original size [2024-11-14 05:27:15,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 86 treesize of output 116 [2024-11-14 05:27:15,126 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2024-11-14 05:27:15,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2024-11-14 05:27:15,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:27:15,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2024-11-14 05:27:16,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:16,547 INFO L349 Elim1Store]: treesize reduction 330, result has 29.5 percent of original size [2024-11-14 05:27:16,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 32 case distinctions, treesize of input 388 treesize of output 393 [2024-11-14 05:27:16,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:27:16,785 INFO L349 Elim1Store]: treesize reduction 208, result has 32.0 percent of original size [2024-11-14 05:27:16,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 278 treesize of output 354 [2024-11-14 05:31:33,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:33,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:33,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:33,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:33,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:34,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:34,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:34,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:34,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:34,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:34,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:34,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:34,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:34,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:34,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:34,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:34,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:35,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:35,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:35,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:15,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:15,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:15,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:15,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:15,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:15,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:16,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:16,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:16,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:20,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:20,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:20,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:21,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:21,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:22,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:23,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:23,587 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:23,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:23,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:23,870 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:23,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:24,000 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:24,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:24,052 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:24,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:24,142 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:24,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:24,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:24,268 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:24,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:24,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:24,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:24,811 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:25,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:25,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:25,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:25,123 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:25,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:25,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:25,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:25,376 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:25,384 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:25,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:25,481 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:31,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:31,366 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:31,374 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:31,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:31,478 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:32,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:33,013 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:33,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:33,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:33,437 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:33,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:33,625 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:34,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:34,205 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:34,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:34,410 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:34,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:34,691 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:35,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:35,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:35,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:35,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:35,499 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:35,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:35,565 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:32:36,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:36,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:36,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:36,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:33:05,943 WARN L286 SmtUtils]: Spent 18.43s on a formula simplification. DAG size of input: 2379 DAG size of output: 2709 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 05:34:34,514 WARN L286 SmtUtils]: Spent 15.64s on a formula simplification. DAG size of input: 2372 DAG size of output: 2374 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 05:36:21,829 WARN L286 SmtUtils]: Spent 13.27s on a formula simplification. DAG size of input: 2883 DAG size of output: 2883 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 05:39:28,096 WARN L286 SmtUtils]: Spent 57.72s on a formula simplification. DAG size of input: 2087 DAG size of output: 3594 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)