./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91 --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 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 23:58:04,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 23:58:04,882 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-24 23:58:04,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 23:58:04,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 23:58:04,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 23:58:04,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 23:58:04,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 23:58:04,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 23:58:04,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 23:58:04,945 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-24 23:58:04,946 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-24 23:58:04,946 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-24 23:58:04,948 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-24 23:58:04,948 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-24 23:58:04,949 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-24 23:58:04,949 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-24 23:58:04,950 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-24 23:58:04,951 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-24 23:58:04,951 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-24 23:58:04,951 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-24 23:58:04,952 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-24 23:58:04,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 23:58:04,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 23:58:04,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 23:58:04,955 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 23:58:04,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 23:58:04,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 23:58:04,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 23:58:04,957 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 23:58:04,958 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 23:58:04,959 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 23:58:04,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 23:58:04,959 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 23:58:04,960 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 23:58:04,960 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 23:58:04,960 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 23:58:04,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 23:58:04,961 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 23:58:04,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 23:58:04,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:58:04,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 23:58:04,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 23:58:04,962 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-24 23:58:04,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 23:58:04,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 23:58:04,963 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-24 23:58:04,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 23:58:04,964 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91 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 -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2023-11-24 23:58:05,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 23:58:05,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 23:58:05,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 23:58:05,387 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 23:58:05,388 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 23:58:05,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-11-24 23:58:08,768 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 23:58:09,108 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 23:58:09,109 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-11-24 23:58:09,132 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/data/666f4eb9d/9156a88d4b72483693fbb32febd1492d/FLAG87956e3b3 [2023-11-24 23:58:09,153 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/data/666f4eb9d/9156a88d4b72483693fbb32febd1492d [2023-11-24 23:58:09,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 23:58:09,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 23:58:09,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 23:58:09,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 23:58:09,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 23:58:09,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c303ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09, skipping insertion in model container [2023-11-24 23:58:09,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,236 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 23:58:09,663 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:58:09,680 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 23:58:09,732 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:58:09,773 INFO L206 MainTranslator]: Completed translation [2023-11-24 23:58:09,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09 WrapperNode [2023-11-24 23:58:09,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 23:58:09,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 23:58:09,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 23:58:09,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 23:58:09,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,828 INFO L138 Inliner]: procedures = 122, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2023-11-24 23:58:09,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 23:58:09,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 23:58:09,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 23:58:09,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 23:58:09,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 23:58:09,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 23:58:09,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 23:58:09,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 23:58:09,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (1/1) ... [2023-11-24 23:58:09,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:58:09,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:09,932 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 23:58:09,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 23:58:09,982 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-24 23:58:09,982 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-24 23:58:09,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 23:58:09,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 23:58:09,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 23:58:09,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 23:58:09,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-24 23:58:09,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 23:58:09,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 23:58:09,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 23:58:09,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 23:58:09,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 23:58:10,160 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 23:58:10,165 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 23:58:10,205 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-24 23:58:10,556 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 23:58:10,594 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 23:58:10,595 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-24 23:58:10,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:58:10 BoogieIcfgContainer [2023-11-24 23:58:10,602 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 23:58:10,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 23:58:10,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 23:58:10,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 23:58:10,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:58:09" (1/3) ... [2023-11-24 23:58:10,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784eb6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:58:10, skipping insertion in model container [2023-11-24 23:58:10,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:09" (2/3) ... [2023-11-24 23:58:10,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784eb6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:58:10, skipping insertion in model container [2023-11-24 23:58:10,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:58:10" (3/3) ... [2023-11-24 23:58:10,612 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2023-11-24 23:58:10,632 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 23:58:10,632 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2023-11-24 23:58:10,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:58:10,685 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@27e03981, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:58:10,686 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2023-11-24 23:58:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 63 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-24 23:58:10,698 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:10,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-24 23:58:10,699 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-24 23:58:10,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:10,705 INFO L85 PathProgramCache]: Analyzing trace with hash 173399, now seen corresponding path program 1 times [2023-11-24 23:58:10,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:10,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399575266] [2023-11-24 23:58:10,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:10,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:10,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:58:10,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:10,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399575266] [2023-11-24 23:58:10,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399575266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:10,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:58:10,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 23:58:10,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702680863] [2023-11-24 23:58:10,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:10,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:58:10,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:11,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:58:11,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:58:11,033 INFO L87 Difference]: Start difference. First operand has 65 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 63 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:11,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:11,149 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2023-11-24 23:58:11,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:58:11,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-24 23:58:11,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:11,159 INFO L225 Difference]: With dead ends: 61 [2023-11-24 23:58:11,159 INFO L226 Difference]: Without dead ends: 56 [2023-11-24 23:58:11,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:58:11,165 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 15 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:11,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 79 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:58:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-24 23:58:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-11-24 23:58:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.935483870967742) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2023-11-24 23:58:11,202 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 3 [2023-11-24 23:58:11,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:11,202 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2023-11-24 23:58:11,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:11,203 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2023-11-24 23:58:11,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-24 23:58:11,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:11,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-24 23:58:11,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 23:58:11,204 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-24 23:58:11,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:11,205 INFO L85 PathProgramCache]: Analyzing trace with hash 173400, now seen corresponding path program 1 times [2023-11-24 23:58:11,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:11,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015787392] [2023-11-24 23:58:11,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:11,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:58:11,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:11,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015787392] [2023-11-24 23:58:11,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015787392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:11,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:58:11,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 23:58:11,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441214122] [2023-11-24 23:58:11,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:11,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:58:11,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:11,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:58:11,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:58:11,339 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:11,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:11,392 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2023-11-24 23:58:11,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:58:11,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-24 23:58:11,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:11,394 INFO L225 Difference]: With dead ends: 53 [2023-11-24 23:58:11,394 INFO L226 Difference]: Without dead ends: 53 [2023-11-24 23:58:11,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:58:11,397 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:11,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 77 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:58:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-24 23:58:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-24 23:58:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2023-11-24 23:58:11,405 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 3 [2023-11-24 23:58:11,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:11,405 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2023-11-24 23:58:11,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2023-11-24 23:58:11,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-24 23:58:11,407 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:11,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:11,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 23:58:11,407 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-24 23:58:11,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:11,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1227553565, now seen corresponding path program 1 times [2023-11-24 23:58:11,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:11,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733052232] [2023-11-24 23:58:11,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:11,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:11,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:58:11,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:11,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733052232] [2023-11-24 23:58:11,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733052232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:11,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:58:11,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:58:11,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785342852] [2023-11-24 23:58:11,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:11,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:58:11,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:11,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:58:11,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:58:11,629 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:11,676 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2023-11-24 23:58:11,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:58:11,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-24 23:58:11,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:11,679 INFO L225 Difference]: With dead ends: 61 [2023-11-24 23:58:11,679 INFO L226 Difference]: Without dead ends: 61 [2023-11-24 23:58:11,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:58:11,681 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 7 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:11,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 96 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:58:11,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-24 23:58:11,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2023-11-24 23:58:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.8125) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-11-24 23:58:11,689 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 7 [2023-11-24 23:58:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:11,690 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-11-24 23:58:11,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-11-24 23:58:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-24 23:58:11,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:11,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:11,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 23:58:11,691 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-24 23:58:11,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:11,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1227432832, now seen corresponding path program 1 times [2023-11-24 23:58:11,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:11,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476467194] [2023-11-24 23:58:11,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:11,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:58:11,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:11,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476467194] [2023-11-24 23:58:11,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476467194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:11,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:58:11,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:58:11,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138098784] [2023-11-24 23:58:11,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:11,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:58:11,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:11,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:58:11,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:58:11,756 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:11,809 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2023-11-24 23:58:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:58:11,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-24 23:58:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:11,810 INFO L225 Difference]: With dead ends: 52 [2023-11-24 23:58:11,811 INFO L226 Difference]: Without dead ends: 52 [2023-11-24 23:58:11,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:58:11,812 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 3 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:11,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 73 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:58:11,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-24 23:58:11,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-24 23:58:11,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.75) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2023-11-24 23:58:11,819 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 7 [2023-11-24 23:58:11,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:11,820 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2023-11-24 23:58:11,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:11,820 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2023-11-24 23:58:11,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-24 23:58:11,821 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:11,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:11,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 23:58:11,821 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-24 23:58:11,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:11,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1227432833, now seen corresponding path program 1 times [2023-11-24 23:58:11,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:11,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289993860] [2023-11-24 23:58:11,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:11,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:58:11,947 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:11,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289993860] [2023-11-24 23:58:11,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289993860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:11,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:58:11,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:58:11,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370364229] [2023-11-24 23:58:11,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:11,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:58:11,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:11,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:58:11,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:58:11,951 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:11,999 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2023-11-24 23:58:11,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:58:11,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-24 23:58:12,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:12,000 INFO L225 Difference]: With dead ends: 50 [2023-11-24 23:58:12,001 INFO L226 Difference]: Without dead ends: 50 [2023-11-24 23:58:12,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:58:12,003 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:12,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 78 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:58:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-24 23:58:12,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-24 23:58:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.6875) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:12,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-11-24 23:58:12,010 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 7 [2023-11-24 23:58:12,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:12,010 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-11-24 23:58:12,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:12,011 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-11-24 23:58:12,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 23:58:12,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:12,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:12,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 23:58:12,012 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-24 23:58:12,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:12,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2128361369, now seen corresponding path program 1 times [2023-11-24 23:58:12,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:12,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950278150] [2023-11-24 23:58:12,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:12,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:58:12,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:12,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950278150] [2023-11-24 23:58:12,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950278150] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:12,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961305192] [2023-11-24 23:58:12,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:12,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:12,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:12,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:58:12,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 23:58:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:12,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 23:58:12,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:58:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:58:12,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:58:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:58:12,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961305192] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:58:12,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1249885278] [2023-11-24 23:58:12,442 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-11-24 23:58:12,442 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:58:12,447 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:58:12,452 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:58:12,453 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:58:14,000 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:58:14,681 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '692#(and (= |ULTIMATE.start_main_~data_new~0#1| 1) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (= |ULTIMATE.start_main_~data_init~0#1| 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 5) (exists ((|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_46| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_46| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26| Int)) (and (= (store |v_#memory_$Pointer$.base_46| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26| (store (select |v_#memory_$Pointer$.base_46| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_45| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26| (store (select |v_#memory_int_45| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26|) 0)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_46| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_46| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26|) 0 0))) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26|)) (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_26|) 1))) (= |ULTIMATE.start_main_~head~1#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| |ULTIMATE.start_main_~head~1#1.base|))' at error location [2023-11-24 23:58:14,681 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:58:14,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:58:14,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-24 23:58:14,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386174513] [2023-11-24 23:58:14,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:58:14,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 23:58:14,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:14,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 23:58:14,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=181, Unknown=1, NotChecked=0, Total=240 [2023-11-24 23:58:14,684 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:14,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:14,726 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2023-11-24 23:58:14,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:58:14,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-24 23:58:14,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:14,728 INFO L225 Difference]: With dead ends: 62 [2023-11-24 23:58:14,728 INFO L226 Difference]: Without dead ends: 62 [2023-11-24 23:58:14,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=181, Unknown=1, NotChecked=0, Total=240 [2023-11-24 23:58:14,730 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:14,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 174 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:58:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-24 23:58:14,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-24 23:58:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.5) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2023-11-24 23:58:14,736 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 11 [2023-11-24 23:58:14,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:14,737 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2023-11-24 23:58:14,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2023-11-24 23:58:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-24 23:58:14,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:14,738 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:14,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-24 23:58:14,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:14,944 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-24 23:58:14,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:14,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1800277435, now seen corresponding path program 2 times [2023-11-24 23:58:14,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:14,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819363093] [2023-11-24 23:58:14,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:14,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-24 23:58:15,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:15,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819363093] [2023-11-24 23:58:15,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819363093] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:15,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:58:15,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 23:58:15,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140207409] [2023-11-24 23:58:15,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:15,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:58:15,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:15,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:58:15,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:58:15,182 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:15,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:15,292 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2023-11-24 23:58:15,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 23:58:15,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-24 23:58:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:15,293 INFO L225 Difference]: With dead ends: 61 [2023-11-24 23:58:15,293 INFO L226 Difference]: Without dead ends: 61 [2023-11-24 23:58:15,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:58:15,294 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:15,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 76 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:58:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-24 23:58:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2023-11-24 23:58:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2023-11-24 23:58:15,300 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 23 [2023-11-24 23:58:15,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:15,300 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2023-11-24 23:58:15,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:15,301 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2023-11-24 23:58:15,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-24 23:58:15,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:15,302 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:15,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 23:58:15,302 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-24 23:58:15,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:15,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1800277434, now seen corresponding path program 1 times [2023-11-24 23:58:15,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:15,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771730479] [2023-11-24 23:58:15,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:15,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-24 23:58:15,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:15,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771730479] [2023-11-24 23:58:15,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771730479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:15,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:58:15,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 23:58:15,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928568314] [2023-11-24 23:58:15,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:15,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:58:15,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:15,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:58:15,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:58:15,608 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:15,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:15,709 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2023-11-24 23:58:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:58:15,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-24 23:58:15,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:15,711 INFO L225 Difference]: With dead ends: 66 [2023-11-24 23:58:15,711 INFO L226 Difference]: Without dead ends: 66 [2023-11-24 23:58:15,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:58:15,716 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:15,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:58:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-24 23:58:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2023-11-24 23:58:15,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2023-11-24 23:58:15,732 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 23 [2023-11-24 23:58:15,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:15,732 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2023-11-24 23:58:15,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2023-11-24 23:58:15,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-24 23:58:15,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:15,736 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:15,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 23:58:15,737 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-24 23:58:15,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:15,737 INFO L85 PathProgramCache]: Analyzing trace with hash 709183653, now seen corresponding path program 1 times [2023-11-24 23:58:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:15,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322116973] [2023-11-24 23:58:15,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:15,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 23:58:16,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:16,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322116973] [2023-11-24 23:58:16,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322116973] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:16,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995226522] [2023-11-24 23:58:16,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:16,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:16,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:16,617 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:58:16,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 23:58:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:16,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-24 23:58:16,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:58:16,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:58:16,898 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 23:58:16,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-24 23:58:16,954 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 23:58:16,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-24 23:58:16,999 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-24 23:58:16,999 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 12 treesize of output 14 [2023-11-24 23:58:17,061 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 23:58:17,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-24 23:58:17,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-24 23:58:17,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-24 23:58:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-24 23:58:17,258 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:58:17,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:58:17,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-24 23:58:17,366 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 36 treesize of output 24 [2023-11-24 23:58:17,377 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 [2023-11-24 23:58:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-24 23:58:17,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995226522] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:58:17,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [674335347] [2023-11-24 23:58:17,820 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-24 23:58:17,820 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:58:17,820 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:58:17,820 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:58:17,821 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:58:18,756 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:58:19,887 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1261#(and (= |ULTIMATE.start_main_~data_new~0#1| 1) (<= 1 |#StackHeapBarrier|) (<= 8 (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (exists ((|v_#memory_int_68| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28| Int)) (and (= (store |v_#memory_$Pointer$.base_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28| (store (select |v_#memory_$Pointer$.base_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28| (store (select |v_#memory_int_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28|) 0)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28| (store (select |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28|) 0 0))) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28|)) (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_28|) 1))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 1)) (= |ULTIMATE.start_main_~data_init~0#1| 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 5) (= |ULTIMATE.start_main_~head~1#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| |ULTIMATE.start_main_~head~1#1.base|))' at error location [2023-11-24 23:58:19,888 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:58:19,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:58:19,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2023-11-24 23:58:19,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257010261] [2023-11-24 23:58:19,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:58:19,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-24 23:58:19,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:19,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-24 23:58:19,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=618, Unknown=2, NotChecked=0, Total=702 [2023-11-24 23:58:19,890 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:20,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:20,289 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2023-11-24 23:58:20,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 23:58:20,290 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-24 23:58:20,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:20,290 INFO L225 Difference]: With dead ends: 63 [2023-11-24 23:58:20,291 INFO L226 Difference]: Without dead ends: 63 [2023-11-24 23:58:20,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=140, Invalid=914, Unknown=2, NotChecked=0, Total=1056 [2023-11-24 23:58:20,292 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:20,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 248 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:58:20,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-24 23:58:20,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2023-11-24 23:58:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.375) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2023-11-24 23:58:20,297 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 27 [2023-11-24 23:58:20,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:20,297 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2023-11-24 23:58:20,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2023-11-24 23:58:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-24 23:58:20,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:20,298 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:20,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 23:58:20,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:20,510 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-24 23:58:20,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:20,510 INFO L85 PathProgramCache]: Analyzing trace with hash 509899322, now seen corresponding path program 1 times [2023-11-24 23:58:20,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:20,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512332416] [2023-11-24 23:58:20,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:20,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:58:21,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:21,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512332416] [2023-11-24 23:58:21,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512332416] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:21,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366590084] [2023-11-24 23:58:21,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:21,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:21,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:21,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:58:21,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 23:58:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:21,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-24 23:58:21,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:58:21,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:58:21,812 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 23:58:21,813 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 [2023-11-24 23:58:21,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:58:21,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-24 23:58:21,921 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 33 treesize of output 17 [2023-11-24 23:58:21,932 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 23 treesize of output 11 [2023-11-24 23:58:22,006 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-24 23:58:22,006 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 29 treesize of output 28 [2023-11-24 23:58:22,031 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-24 23:58:22,031 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 19 treesize of output 18 [2023-11-24 23:58:22,216 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 23:58:22,216 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 1 case distinctions, treesize of input 48 treesize of output 35 [2023-11-24 23:58:22,227 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 23:58:22,227 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 1 case distinctions, treesize of input 55 treesize of output 46 [2023-11-24 23:58:22,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:58:22,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2023-11-24 23:58:22,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:58:22,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2023-11-24 23:58:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:58:22,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:58:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:58:23,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366590084] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:58:23,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1496176678] [2023-11-24 23:58:23,032 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-24 23:58:23,032 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:58:23,032 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:58:23,033 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:58:23,033 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:58:25,014 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:58:26,295 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1592#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (= |ULTIMATE.start_main_~data_init~0#1| 1) (<= 1 |ULTIMATE.start_main_~data_new~0#1|) (= |ULTIMATE.start_main_~len~0#1| 5) (= |ULTIMATE.start_main_~head~1#1.offset| 0))' at error location [2023-11-24 23:58:26,295 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:58:26,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:58:26,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-11-24 23:58:26,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337345523] [2023-11-24 23:58:26,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:58:26,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-24 23:58:26,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:26,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-24 23:58:26,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1068, Unknown=2, NotChecked=0, Total=1190 [2023-11-24 23:58:26,298 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:27,164 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2023-11-24 23:58:27,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 23:58:27,164 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-24 23:58:27,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:27,165 INFO L225 Difference]: With dead ends: 100 [2023-11-24 23:58:27,165 INFO L226 Difference]: Without dead ends: 100 [2023-11-24 23:58:27,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=225, Invalid=1665, Unknown=2, NotChecked=0, Total=1892 [2023-11-24 23:58:27,167 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 149 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:27,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 134 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 23:58:27,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-24 23:58:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 70. [2023-11-24 23:58:27,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:27,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2023-11-24 23:58:27,172 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 28 [2023-11-24 23:58:27,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:27,173 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2023-11-24 23:58:27,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:27,173 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2023-11-24 23:58:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-24 23:58:27,174 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:27,174 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:27,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-24 23:58:27,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-24 23:58:27,380 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-24 23:58:27,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash 509899323, now seen corresponding path program 1 times [2023-11-24 23:58:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:27,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036149552] [2023-11-24 23:58:27,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:27,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:58:28,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:28,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036149552] [2023-11-24 23:58:28,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036149552] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:28,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479271172] [2023-11-24 23:58:28,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:28,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:28,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:28,460 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:58:28,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 23:58:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:28,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-24 23:58:28,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:58:28,735 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 23:58:28,735 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 [2023-11-24 23:58:28,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:58:28,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-24 23:58:28,882 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 23 treesize of output 11 [2023-11-24 23:58:28,897 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 33 treesize of output 17 [2023-11-24 23:58:28,976 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-24 23:58:28,976 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 29 treesize of output 28 [2023-11-24 23:58:28,992 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-24 23:58:28,993 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 19 treesize of output 18 [2023-11-24 23:58:29,161 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 23:58:29,162 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 1 case distinctions, treesize of input 48 treesize of output 35 [2023-11-24 23:58:29,172 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 23:58:29,173 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 1 case distinctions, treesize of input 55 treesize of output 46 [2023-11-24 23:58:29,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:58:29,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2023-11-24 23:58:29,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:58:29,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2023-11-24 23:58:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:58:29,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:58:30,323 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 64 treesize of output 58 [2023-11-24 23:58:30,385 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:58:30,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479271172] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:58:30,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [824033516] [2023-11-24 23:58:30,388 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-24 23:58:30,388 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:58:30,389 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:58:30,389 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:58:30,389 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:58:32,250 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:58:33,813 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1982#(and (<= 1 |#StackHeapBarrier|) (or (< (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) 0) (< (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data_init~0#1| 1) (<= 1 |ULTIMATE.start_main_~data_new~0#1|) (= |ULTIMATE.start_main_~len~0#1| 5) (= |ULTIMATE.start_main_~head~1#1.offset| 0))' at error location [2023-11-24 23:58:33,813 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:58:33,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:58:33,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2023-11-24 23:58:33,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452524486] [2023-11-24 23:58:33,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:58:33,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-24 23:58:33,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:33,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-24 23:58:33,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1329, Unknown=2, NotChecked=0, Total=1482 [2023-11-24 23:58:33,818 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:36,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:36,320 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2023-11-24 23:58:36,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-24 23:58:36,320 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-24 23:58:36,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:36,321 INFO L225 Difference]: With dead ends: 84 [2023-11-24 23:58:36,321 INFO L226 Difference]: Without dead ends: 84 [2023-11-24 23:58:36,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=312, Invalid=2236, Unknown=2, NotChecked=0, Total=2550 [2023-11-24 23:58:36,324 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 104 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:36,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 119 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-24 23:58:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-24 23:58:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2023-11-24 23:58:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 71 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:36,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2023-11-24 23:58:36,330 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 28 [2023-11-24 23:58:36,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:36,330 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2023-11-24 23:58:36,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:36,331 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2023-11-24 23:58:36,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-24 23:58:36,332 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:36,332 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:36,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 23:58:36,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-24 23:58:36,543 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-24 23:58:36,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:36,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1776499174, now seen corresponding path program 1 times [2023-11-24 23:58:36,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:36,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230681207] [2023-11-24 23:58:36,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:36,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 23:58:38,488 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:38,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230681207] [2023-11-24 23:58:38,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230681207] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:38,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990296530] [2023-11-24 23:58:38,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:38,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:38,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:38,490 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:58:38,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 23:58:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:38,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-24 23:58:38,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:58:38,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:58:38,962 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-24 23:58:38,962 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 20 treesize of output 23 [2023-11-24 23:58:38,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-24 23:58:38,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:58:39,041 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 23 treesize of output 11 [2023-11-24 23:58:39,048 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 35 treesize of output 19 [2023-11-24 23:58:39,065 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-24 23:58:39,066 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 28 treesize of output 31 [2023-11-24 23:58:39,184 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-24 23:58:39,184 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 30 [2023-11-24 23:58:39,192 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 15 [2023-11-24 23:58:39,208 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-24 23:58:39,209 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 19 treesize of output 18 [2023-11-24 23:58:39,475 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 23:58:39,475 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 1 case distinctions, treesize of input 50 treesize of output 37 [2023-11-24 23:58:39,494 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-24 23:58:39,495 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 43 treesize of output 46 [2023-11-24 23:58:39,503 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 23:58:39,503 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 1 case distinctions, treesize of input 51 treesize of output 42 [2023-11-24 23:58:39,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:58:39,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2023-11-24 23:58:39,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:58:39,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2023-11-24 23:58:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:58:39,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:58:40,038 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_967 Int) (v_ArrVal_972 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_972) .cse0) (+ (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_967 Int) (v_ArrVal_972 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_972) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (+ .cse1 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2023-11-24 23:58:41,020 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (or (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 .cse2))))))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1))))) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_967 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse3 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse3 .cse2)) (= (select v_ArrVal_972 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_967 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_967 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse4 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse4 .cse2)))))) .cse5) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 .cse2)) (= (select v_ArrVal_972 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 .cse2)) (= (select v_ArrVal_972 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 .cse2)) (= (select v_ArrVal_972 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 .cse2))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1)))))) .cse5) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse10 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse10 .cse2))))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))) is different from false [2023-11-24 23:58:41,625 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 .cse1))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse2 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse2 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_972 4))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1)))))) .cse3) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse4 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse4 .cse1))))))))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 .cse1))))))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1))))) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_967 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_967 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_972 4))))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_967 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 .cse1)))))) .cse3) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_972 4))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_967 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_962) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_967)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_972 4))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))) is different from false [2023-11-24 23:58:41,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:58:41,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2023-11-24 23:58:41,763 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 23:58:41,764 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 23:58:41,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:58:41,775 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2023-11-24 23:58:41,810 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 41 treesize of output 29 [2023-11-24 23:58:41,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:58:41,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 55 [2023-11-24 23:58:41,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:58:41,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 349 treesize of output 339 [2023-11-24 23:58:41,860 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 23:58:41,865 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 23:58:41,866 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 0 case distinctions, treesize of input 106 treesize of output 100 [2023-11-24 23:58:41,883 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 23:58:41,884 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 0 case distinctions, treesize of input 34 treesize of output 24 [2023-11-24 23:58:41,935 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 8 treesize of output 4 [2023-11-24 23:58:41,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:58:41,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 55 [2023-11-24 23:58:41,952 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 23:58:41,963 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-24 23:58:41,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 128 treesize of output 121 [2023-11-24 23:58:41,972 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 23:58:41,973 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 0 case distinctions, treesize of input 31 treesize of output 21 [2023-11-24 23:58:41,979 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 23:58:41,979 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 0 case distinctions, treesize of input 13 treesize of output 7 [2023-11-24 23:58:41,990 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 23:58:41,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 1 [2023-11-24 23:58:42,002 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 23:58:42,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 1 [2023-11-24 23:58:42,012 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 23:58:42,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 1 [2023-11-24 23:58:42,021 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 23:58:42,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 1 [2023-11-24 23:58:42,032 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 23:58:42,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 1 [2023-11-24 23:58:42,209 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 13 not checked. [2023-11-24 23:58:42,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990296530] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:58:42,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [853257175] [2023-11-24 23:58:42,212 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-24 23:58:42,212 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:58:42,212 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:58:42,213 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:58:42,213 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:58:44,279 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:58:46,074 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2399#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data_init~0#1| 1) (<= 1 |ULTIMATE.start_main_~data_new~0#1|) (= |ULTIMATE.start_main_~len~0#1| 5) (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) (exists ((|v_ULTIMATE.start_main_#t~mem7#1_34| Int)) (and (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (not (= |v_ULTIMATE.start_main_#t~mem7#1_34| 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |v_ULTIMATE.start_main_#t~mem7#1_34|))) (= |ULTIMATE.start_main_~head~1#1.offset| 0))' at error location [2023-11-24 23:58:46,074 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:58:46,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:58:46,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 12] total 37 [2023-11-24 23:58:46,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093294729] [2023-11-24 23:58:46,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:58:46,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-24 23:58:46,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:46,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-24 23:58:46,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1985, Unknown=11, NotChecked=276, Total=2450 [2023-11-24 23:58:46,077 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:49,698 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2023-11-24 23:58:49,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-24 23:58:49,700 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-24 23:58:49,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:49,702 INFO L225 Difference]: With dead ends: 99 [2023-11-24 23:58:49,703 INFO L226 Difference]: Without dead ends: 99 [2023-11-24 23:58:49,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=395, Invalid=3266, Unknown=11, NotChecked=360, Total=4032 [2023-11-24 23:58:49,705 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 91 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:49,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 328 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 900 Invalid, 0 Unknown, 220 Unchecked, 1.3s Time] [2023-11-24 23:58:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-24 23:58:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 72. [2023-11-24 23:58:49,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 71 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:49,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2023-11-24 23:58:49,712 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 32 [2023-11-24 23:58:49,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:49,713 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2023-11-24 23:58:49,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:58:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2023-11-24 23:58:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-24 23:58:49,715 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:49,715 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:49,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-24 23:58:49,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:49,923 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-24 23:58:49,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:49,923 INFO L85 PathProgramCache]: Analyzing trace with hash -304643481, now seen corresponding path program 1 times [2023-11-24 23:58:49,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:49,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332294434] [2023-11-24 23:58:49,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:49,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:58:50,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:50,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332294434] [2023-11-24 23:58:50,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332294434] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:50,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358678062] [2023-11-24 23:58:50,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:50,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:50,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:50,597 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:58:50,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b9e0f81-0e90-49c4-be03-462b9535a8e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-24 23:58:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:50,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-24 23:58:50,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:58:50,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:58:50,866 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 23:58:50,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-24 23:58:50,909 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 23:58:50,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-24 23:58:50,939 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-24 23:58:50,940 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 12 treesize of output 14 [2023-11-24 23:58:51,042 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-24 23:58:51,043 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 [2023-11-24 23:58:51,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-24 23:58:51,134 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 24 treesize of output 12 [2023-11-24 23:58:51,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2023-11-24 23:58:51,280 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 23:58:51,280 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 1 case distinctions, treesize of input 31 treesize of output 22 [2023-11-24 23:58:51,300 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 23:58:51,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2023-11-24 23:58:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:58:51,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:58:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:58:51,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358678062] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:58:51,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1897593928] [2023-11-24 23:58:51,729 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-11-24 23:58:51,730 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:58:51,730 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:58:51,730 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:58:51,730 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:58:52,667 INFO L180 IcfgInterpreter]: Interpretation finished