./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b 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_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9 --witnessprinter.witness.filename witness.graphml --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 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 21:05:27,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 21:05:27,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 21:05:27,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 21:05:27,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 21:05:27,936 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 21:05:27,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 21:05:27,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 21:05:27,942 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 21:05:27,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 21:05:27,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 21:05:27,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 21:05:27,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 21:05:27,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 21:05:27,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 21:05:27,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 21:05:27,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 21:05:27,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 21:05:27,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 21:05:27,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 21:05:27,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 21:05:27,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 21:05:27,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 21:05:27,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 21:05:27,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 21:05:27,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 21:05:27,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 21:05:27,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 21:05:27,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 21:05:27,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 21:05:27,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 21:05:27,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 21:05:27,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 21:05:27,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 21:05:27,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 21:05:27,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 21:05:27,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 21:05:27,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 21:05:27,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 21:05:28,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 21:05:28,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 21:05:28,004 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-20 21:05:28,048 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 21:05:28,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 21:05:28,049 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 21:05:28,050 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 21:05:28,051 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 21:05:28,051 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 21:05:28,051 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 21:05:28,051 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 21:05:28,052 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 21:05:28,052 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 21:05:28,053 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 21:05:28,053 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 21:05:28,053 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 21:05:28,053 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 21:05:28,054 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 21:05:28,054 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 21:05:28,054 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 21:05:28,054 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 21:05:28,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 21:05:28,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 21:05:28,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 21:05:28,056 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 21:05:28,056 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 21:05:28,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 21:05:28,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 21:05:28,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 21:05:28,057 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 21:05:28,057 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 21:05:28,058 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 21:05:28,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 21:05:28,058 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 21:05:28,058 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 21:05:28,059 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 21:05:28,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 21:05:28,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 21:05:28,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 21:05:28,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 21:05:28,060 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 21:05:28,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 21:05:28,060 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 21:05:28,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 21:05:28,060 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 21:05:28,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/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_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2022-11-20 21:05:28,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 21:05:28,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 21:05:28,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 21:05:28,403 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 21:05:28,404 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 21:05:28,405 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2022-11-20 21:05:31,635 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 21:05:31,931 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 21:05:31,932 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2022-11-20 21:05:31,951 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/data/206a0b211/df81e652b7c948f197c1cb956c3913c3/FLAG357d9b354 [2022-11-20 21:05:31,969 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/data/206a0b211/df81e652b7c948f197c1cb956c3913c3 [2022-11-20 21:05:31,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 21:05:31,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 21:05:31,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 21:05:31,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 21:05:31,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 21:05:31,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:05:31" (1/1) ... [2022-11-20 21:05:31,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c9908a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:31, skipping insertion in model container [2022-11-20 21:05:31,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:05:31" (1/1) ... [2022-11-20 21:05:31,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 21:05:32,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 21:05:32,410 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2022-11-20 21:05:32,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 21:05:32,429 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 21:05:32,500 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2022-11-20 21:05:32,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 21:05:32,526 INFO L208 MainTranslator]: Completed translation [2022-11-20 21:05:32,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:32 WrapperNode [2022-11-20 21:05:32,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 21:05:32,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 21:05:32,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 21:05:32,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 21:05:32,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:32" (1/1) ... [2022-11-20 21:05:32,550 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:32" (1/1) ... [2022-11-20 21:05:32,580 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 147 [2022-11-20 21:05:32,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 21:05:32,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 21:05:32,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 21:05:32,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 21:05:32,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:32" (1/1) ... [2022-11-20 21:05:32,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:32" (1/1) ... [2022-11-20 21:05:32,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:32" (1/1) ... [2022-11-20 21:05:32,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:32" (1/1) ... [2022-11-20 21:05:32,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:32" (1/1) ... [2022-11-20 21:05:32,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:32" (1/1) ... [2022-11-20 21:05:32,612 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:32" (1/1) ... [2022-11-20 21:05:32,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:32" (1/1) ... [2022-11-20 21:05:32,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 21:05:32,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 21:05:32,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 21:05:32,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 21:05:32,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:32" (1/1) ... [2022-11-20 21:05:32,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 21:05:32,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:32,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 21:05:32,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 21:05:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 21:05:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 21:05:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-20 21:05:32,699 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-20 21:05:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 21:05:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 21:05:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 21:05:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 21:05:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 21:05:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 21:05:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 21:05:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 21:05:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 21:05:32,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 21:05:32,821 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 21:05:32,823 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 21:05:33,412 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 21:05:33,491 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 21:05:33,491 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 21:05:33,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:05:33 BoogieIcfgContainer [2022-11-20 21:05:33,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 21:05:33,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 21:05:33,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 21:05:33,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 21:05:33,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:05:31" (1/3) ... [2022-11-20 21:05:33,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6feb2d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:05:33, skipping insertion in model container [2022-11-20 21:05:33,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:32" (2/3) ... [2022-11-20 21:05:33,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6feb2d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:05:33, skipping insertion in model container [2022-11-20 21:05:33,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:05:33" (3/3) ... [2022-11-20 21:05:33,502 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2022-11-20 21:05:33,522 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 21:05:33,522 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2022-11-20 21:05:33,573 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 21:05:33,579 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;@6e4655de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 21:05:33,579 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-11-20 21:05:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 48 states have (on average 2.3125) internal successors, (111), 100 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:05:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 21:05:33,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:33,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 21:05:33,591 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:05:33,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:33,596 INFO L85 PathProgramCache]: Analyzing trace with hash 224891455, now seen corresponding path program 1 times [2022-11-20 21:05:33,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:33,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719813324] [2022-11-20 21:05:33,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:33,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:33,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:33,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719813324] [2022-11-20 21:05:33,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719813324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:05:33,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:05:33,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 21:05:33,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103436290] [2022-11-20 21:05:33,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:05:33,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 21:05:33,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:33,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 21:05:33,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:05:33,964 INFO L87 Difference]: Start difference. First operand has 105 states, 48 states have (on average 2.3125) internal successors, (111), 100 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:34,178 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-11-20 21:05:34,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 21:05:34,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 21:05:34,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:34,189 INFO L225 Difference]: With dead ends: 103 [2022-11-20 21:05:34,189 INFO L226 Difference]: Without dead ends: 101 [2022-11-20 21:05:34,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:05:34,194 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 6 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:34,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 142 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 21:05:34,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-20 21:05:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-11-20 21:05:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 47 states have (on average 2.2127659574468086) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:05:34,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-11-20 21:05:34,237 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 5 [2022-11-20 21:05:34,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:34,238 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-11-20 21:05:34,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-11-20 21:05:34,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 21:05:34,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:34,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 21:05:34,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 21:05:34,240 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:05:34,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:34,241 INFO L85 PathProgramCache]: Analyzing trace with hash 224891456, now seen corresponding path program 1 times [2022-11-20 21:05:34,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:34,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595261736] [2022-11-20 21:05:34,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:34,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:34,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:34,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595261736] [2022-11-20 21:05:34,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595261736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:05:34,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:05:34,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 21:05:34,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578011045] [2022-11-20 21:05:34,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:05:34,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 21:05:34,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:34,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 21:05:34,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:05:34,358 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:34,514 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-11-20 21:05:34,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 21:05:34,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 21:05:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:34,516 INFO L225 Difference]: With dead ends: 99 [2022-11-20 21:05:34,516 INFO L226 Difference]: Without dead ends: 99 [2022-11-20 21:05:34,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:05:34,518 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:34,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 147 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:05:34,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-20 21:05:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-20 21:05:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 47 states have (on average 2.1702127659574466) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:05:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-11-20 21:05:34,528 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 5 [2022-11-20 21:05:34,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:34,529 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-11-20 21:05:34,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:05:34,529 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-11-20 21:05:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 21:05:34,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:34,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:34,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 21:05:34,531 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:05:34,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:34,532 INFO L85 PathProgramCache]: Analyzing trace with hash -739070550, now seen corresponding path program 1 times [2022-11-20 21:05:34,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:34,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423883674] [2022-11-20 21:05:34,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:34,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:34,659 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:34,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423883674] [2022-11-20 21:05:34,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423883674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:05:34,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:05:34,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 21:05:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060860710] [2022-11-20 21:05:34,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:05:34,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 21:05:34,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:34,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 21:05:34,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 21:05:34,662 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 21:05:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:34,906 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2022-11-20 21:05:34,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 21:05:34,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-20 21:05:34,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:34,914 INFO L225 Difference]: With dead ends: 103 [2022-11-20 21:05:34,915 INFO L226 Difference]: Without dead ends: 103 [2022-11-20 21:05:34,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 21:05:34,923 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 5 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:34,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 277 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 21:05:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-20 21:05:34,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-11-20 21:05:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 49 states have (on average 2.163265306122449) internal successors, (106), 96 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:05:34,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2022-11-20 21:05:34,947 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 10 [2022-11-20 21:05:34,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:34,948 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2022-11-20 21:05:34,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 21:05:34,948 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2022-11-20 21:05:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 21:05:34,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:34,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:34,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 21:05:34,949 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:05:34,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:34,951 INFO L85 PathProgramCache]: Analyzing trace with hash -739070549, now seen corresponding path program 1 times [2022-11-20 21:05:34,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:34,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098259841] [2022-11-20 21:05:34,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:34,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:35,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:35,052 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:35,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098259841] [2022-11-20 21:05:35,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098259841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:05:35,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:05:35,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 21:05:35,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435448762] [2022-11-20 21:05:35,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:05:35,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 21:05:35,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:35,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 21:05:35,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:05:35,055 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 21:05:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:35,095 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-11-20 21:05:35,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 21:05:35,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-20 21:05:35,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:35,096 INFO L225 Difference]: With dead ends: 100 [2022-11-20 21:05:35,097 INFO L226 Difference]: Without dead ends: 100 [2022-11-20 21:05:35,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:05:35,098 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 4 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 176 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 [2022-11-20 21:05:35,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 176 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 21:05:35,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-20 21:05:35,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-11-20 21:05:35,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:05:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2022-11-20 21:05:35,106 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 10 [2022-11-20 21:05:35,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:35,106 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2022-11-20 21:05:35,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 21:05:35,107 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2022-11-20 21:05:35,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 21:05:35,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:35,108 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:35,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 21:05:35,108 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:05:35,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:35,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1505132138, now seen corresponding path program 1 times [2022-11-20 21:05:35,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:35,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245459251] [2022-11-20 21:05:35,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:35,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 21:05:35,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:35,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245459251] [2022-11-20 21:05:35,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245459251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:05:35,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:05:35,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 21:05:35,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850451963] [2022-11-20 21:05:35,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:05:35,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 21:05:35,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:35,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 21:05:35,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 21:05:35,284 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 21:05:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:35,509 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2022-11-20 21:05:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 21:05:35,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-11-20 21:05:35,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:35,512 INFO L225 Difference]: With dead ends: 100 [2022-11-20 21:05:35,512 INFO L226 Difference]: Without dead ends: 100 [2022-11-20 21:05:35,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 21:05:35,520 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:35,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 283 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 21:05:35,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-20 21:05:35,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2022-11-20 21:05:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 48 states have (on average 2.125) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:05:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-11-20 21:05:35,533 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 17 [2022-11-20 21:05:35,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:35,533 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-11-20 21:05:35,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 21:05:35,533 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-11-20 21:05:35,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 21:05:35,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:35,534 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:35,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 21:05:35,535 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:05:35,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:35,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1505132139, now seen corresponding path program 1 times [2022-11-20 21:05:35,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:35,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111752038] [2022-11-20 21:05:35,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:35,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:05:35,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:35,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111752038] [2022-11-20 21:05:35,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111752038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:05:35,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:05:35,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 21:05:35,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846051481] [2022-11-20 21:05:35,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:05:35,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 21:05:35,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:35,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 21:05:35,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 21:05:35,781 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 21:05:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:35,998 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2022-11-20 21:05:35,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 21:05:35,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-11-20 21:05:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:35,999 INFO L225 Difference]: With dead ends: 99 [2022-11-20 21:05:36,000 INFO L226 Difference]: Without dead ends: 99 [2022-11-20 21:05:36,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 21:05:36,001 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 7 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:36,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 307 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 21:05:36,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-20 21:05:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2022-11-20 21:05:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:05:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2022-11-20 21:05:36,009 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 17 [2022-11-20 21:05:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:36,009 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2022-11-20 21:05:36,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 21:05:36,010 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2022-11-20 21:05:36,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 21:05:36,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:36,010 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:36,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 21:05:36,011 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:05:36,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:36,012 INFO L85 PathProgramCache]: Analyzing trace with hash -971798934, now seen corresponding path program 1 times [2022-11-20 21:05:36,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:36,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818280020] [2022-11-20 21:05:36,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:36,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:05:36,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:36,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818280020] [2022-11-20 21:05:36,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818280020] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:36,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458346560] [2022-11-20 21:05:36,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:36,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:36,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:36,374 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:36,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 21:05:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:36,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 21:05:36,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:36,635 INFO L350 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 [2022-11-20 21:05:36,709 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_174 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_174))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-20 21:05:36,815 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 21:05:36,818 INFO L350 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 17 treesize of output 21 [2022-11-20 21:05:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-20 21:05:36,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:36,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458346560] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:36,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1735852712] [2022-11-20 21:05:36,943 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-20 21:05:36,943 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:05:36,948 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 21:05:36,953 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 21:05:36,954 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 21:05:37,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:37,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:37,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 21:05:37,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:37,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:37,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 21:05:37,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:37,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 21:05:37,175 INFO L350 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 11 treesize of output 7 [2022-11-20 21:05:37,181 INFO L350 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 11 treesize of output 7 [2022-11-20 21:05:37,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 21:05:37,200 INFO L350 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 [2022-11-20 21:05:37,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:37,214 INFO L350 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 27 treesize of output 11 [2022-11-20 21:05:37,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:37,227 INFO L350 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 27 treesize of output 11 [2022-11-20 21:05:37,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:37,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:37,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 21:05:37,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:37,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:37,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 21:05:37,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:37,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:37,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 21:05:37,650 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-20 21:05:37,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 197 [2022-11-20 21:05:37,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 21:05:37,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 21:05:37,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:37,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:37,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:37,951 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:37,953 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:37,957 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:37,959 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:37,961 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:38,053 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-20 21:05:38,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 197 [2022-11-20 21:05:38,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:38,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:38,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 21:05:38,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:38,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 21:05:38,358 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:38,360 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:38,362 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:38,364 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:38,367 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:38,429 INFO L350 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 19 treesize of output 11 [2022-11-20 21:05:38,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:38,442 INFO L350 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 23 treesize of output 11 [2022-11-20 21:05:38,454 INFO L350 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 19 treesize of output 11 [2022-11-20 21:05:38,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:38,755 INFO L350 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 133 treesize of output 117 [2022-11-20 21:05:38,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:05:38,769 INFO L350 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 0 case distinctions, treesize of input 129 treesize of output 117 [2022-11-20 21:05:38,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:05:38,781 INFO L350 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 0 case distinctions, treesize of input 121 treesize of output 109 [2022-11-20 21:05:39,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:39,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:39,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 21:05:39,150 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 65 for LOIs [2022-11-20 21:05:39,403 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 21:05:41,749 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1424#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-20 21:05:41,749 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 21:05:41,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:05:41,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2022-11-20 21:05:41,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003499804] [2022-11-20 21:05:41,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:41,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 21:05:41,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:41,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 21:05:41,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=432, Unknown=2, NotChecked=42, Total=552 [2022-11-20 21:05:41,751 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 21:05:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:42,094 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-11-20 21:05:42,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 21:05:42,095 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2022-11-20 21:05:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:42,095 INFO L225 Difference]: With dead ends: 97 [2022-11-20 21:05:42,096 INFO L226 Difference]: Without dead ends: 97 [2022-11-20 21:05:42,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=90, Invalid=512, Unknown=2, NotChecked=46, Total=650 [2022-11-20 21:05:42,097 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:42,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 399 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 375 Invalid, 0 Unknown, 110 Unchecked, 0.3s Time] [2022-11-20 21:05:42,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-20 21:05:42,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-11-20 21:05:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 92 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:05:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-11-20 21:05:42,103 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 19 [2022-11-20 21:05:42,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:42,103 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-11-20 21:05:42,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 21:05:42,104 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-11-20 21:05:42,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 21:05:42,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:42,105 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:42,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:42,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:42,306 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:05:42,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash -971798933, now seen corresponding path program 1 times [2022-11-20 21:05:42,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:42,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936117552] [2022-11-20 21:05:42,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:42,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:05:42,593 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:42,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936117552] [2022-11-20 21:05:42,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936117552] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:42,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770427329] [2022-11-20 21:05:42,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:42,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:42,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:42,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:42,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 21:05:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:42,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 21:05:42,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:42,742 INFO L350 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 [2022-11-20 21:05:42,882 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_251 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_251))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-20 21:05:42,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:42,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 21:05:42,924 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 21:05:42,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 21:05:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-20 21:05:42,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:43,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770427329] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:43,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [493479516] [2022-11-20 21:05:43,120 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-20 21:05:43,120 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:05:43,120 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 21:05:43,120 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 21:05:43,120 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 21:05:43,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:43,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:43,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 21:05:43,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:43,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:43,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 21:05:43,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 21:05:43,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:43,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 21:05:43,200 INFO L350 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 11 treesize of output 7 [2022-11-20 21:05:43,205 INFO L350 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 11 treesize of output 7 [2022-11-20 21:05:43,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:43,215 INFO L350 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 27 treesize of output 11 [2022-11-20 21:05:43,221 INFO L350 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 [2022-11-20 21:05:43,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:43,227 INFO L350 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 27 treesize of output 11 [2022-11-20 21:05:43,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:43,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:43,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 21:05:43,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:43,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:43,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 21:05:43,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:43,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:43,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 21:05:43,464 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-20 21:05:43,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 197 [2022-11-20 21:05:43,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:43,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:43,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:43,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:43,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:43,779 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:43,784 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:43,786 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:43,787 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:43,868 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-20 21:05:43,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 197 [2022-11-20 21:05:44,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:44,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:44,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:44,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:44,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:44,134 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:44,136 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:44,138 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:44,141 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:44,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:44,192 INFO L350 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 23 treesize of output 11 [2022-11-20 21:05:44,201 INFO L350 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 19 treesize of output 11 [2022-11-20 21:05:44,215 INFO L350 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 19 treesize of output 11 [2022-11-20 21:05:44,394 INFO L350 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 [2022-11-20 21:05:44,402 INFO L350 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 [2022-11-20 21:05:44,412 INFO L350 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 [2022-11-20 21:05:44,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:44,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:44,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 21:05:44,741 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 65 for LOIs [2022-11-20 21:05:44,956 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 21:05:45,693 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (<= (+ 8 |c_node_create_~temp~0#1.offset|) (select |c_#length| |c_node_create_~temp~0#1.base|)) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (<= 0 |c_#NULL.base|) (= |c_node_create_~temp~0#1.offset| 0) (let ((.cse7 (+ |c_node_create_~temp~0#1.offset| 4))) (let ((.cse1 (= |c_#NULL.offset| 0)) (.cse2 (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| 0) .cse7 (select (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) .cse7))))) (.cse3 (= |c_#NULL.base| 0)) (.cse4 (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1))) (.cse5 (= (store |c_old(#length)| |c_node_create_~temp~0#1.base| 8) |c_#length|)) (.cse8 (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) (.cse6 (select |c_old(#memory_int)| |c_node_create_~temp~0#1.base|)) (.cse9 (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base|) |c_node_create_~temp~0#1.offset| 0) .cse7 (select (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) .cse7)))))) (or (let ((.cse0 (select |c_old(#memory_int)| 1))) (and (< 0 |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| 1) (= 48 (select .cse0 0)) .cse1 (= (select |c_old(#valid)| 1) 1) .cse2 (= (select |c_old(#valid)| 2) 1) (= (select |c_old(#valid)| 0) 0) .cse3 .cse4 (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| Int)) (and (= (select |c_old(#length)| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|) 4) (= (select |c_old(#valid)| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|) 1) (not (= |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| 0)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|))) (= (select .cse0 1) 0) .cse5 (exists ((v_DerPreprocessor_3 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (store (store .cse6 |c_node_create_~temp~0#1.offset| v_DerPreprocessor_3) .cse7 |c_node_create_~data#1|)))) (= 21 (select |c_old(#length)| 2)) .cse8 (= (select |c_old(#length)| 1) 2) .cse9)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 (exists ((v_DerPreprocessor_4 Int)) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (store (store .cse6 |c_node_create_~temp~0#1.offset| v_DerPreprocessor_4) .cse7 |c_node_create_~data#1|)) |c_#memory_int|)) .cse9)))) (<= 1 |c_node_create_#in~data#1|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (<= 0 |c_#NULL.offset|) (= |c_node_create_~temp~0#1.base| |c_node_create_#res#1.base|) (<= 0 |c_#StackHeapBarrier|) (= |c_node_create_#res#1.offset| |c_node_create_~temp~0#1.offset|) (<= |c_node_create_#in~data#1| 1) (<= |c_#NULL.base| 0) (<= |c_#NULL.offset| 0)) is different from true [2022-11-20 21:05:47,067 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1723#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (< (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-20 21:05:47,067 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 21:05:47,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:05:47,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-11-20 21:05:47,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444615961] [2022-11-20 21:05:47,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:47,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 21:05:47,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:47,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 21:05:47,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=674, Unknown=2, NotChecked=106, Total=870 [2022-11-20 21:05:47,070 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 21:05:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:47,653 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-11-20 21:05:47,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 21:05:47,654 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2022-11-20 21:05:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:47,655 INFO L225 Difference]: With dead ends: 97 [2022-11-20 21:05:47,655 INFO L226 Difference]: Without dead ends: 97 [2022-11-20 21:05:47,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=113, Invalid=885, Unknown=2, NotChecked=122, Total=1122 [2022-11-20 21:05:47,656 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 3 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:47,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 622 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 632 Invalid, 0 Unknown, 112 Unchecked, 0.4s Time] [2022-11-20 21:05:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-20 21:05:47,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2022-11-20 21:05:47,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 48 states have (on average 2.0625) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:05:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-11-20 21:05:47,661 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 19 [2022-11-20 21:05:47,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:47,662 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-11-20 21:05:47,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 21:05:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-11-20 21:05:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 21:05:47,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:47,663 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:47,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:47,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:47,869 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:05:47,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:47,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1349502893, now seen corresponding path program 1 times [2022-11-20 21:05:47,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:47,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739832923] [2022-11-20 21:05:47,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:47,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 21:05:48,463 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:48,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739832923] [2022-11-20 21:05:48,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739832923] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:48,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925168169] [2022-11-20 21:05:48,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:48,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:48,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:48,465 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:48,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 21:05:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:48,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-20 21:05:48,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:48,614 INFO L350 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 [2022-11-20 21:05:48,622 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_368 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_368))) is different from true [2022-11-20 21:05:48,637 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_368 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_368))) is different from true [2022-11-20 21:05:48,650 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:05:48,651 INFO L350 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 18 [2022-11-20 21:05:48,696 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-20 21:05:48,714 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:05:48,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-20 21:05:48,820 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 21:05:48,821 INFO L350 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 [2022-11-20 21:05:48,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2022-11-20 21:05:48,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 21:05:49,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925168169] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:05:49,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1793700492] [2022-11-20 21:05:49,392 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-20 21:05:49,392 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:05:49,392 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 21:05:49,393 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 21:05:49,393 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 21:05:49,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:49,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:49,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 21:05:49,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:49,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:49,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 21:05:49,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 21:05:49,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:49,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 21:05:49,473 INFO L350 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 11 treesize of output 7 [2022-11-20 21:05:49,477 INFO L350 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 11 treesize of output 7 [2022-11-20 21:05:49,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:49,486 INFO L350 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 27 treesize of output 11 [2022-11-20 21:05:49,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:49,493 INFO L350 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 27 treesize of output 11 [2022-11-20 21:05:49,499 INFO L350 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 [2022-11-20 21:05:49,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:49,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:49,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 21:05:49,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:49,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:49,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 21:05:49,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:49,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:49,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 21:05:49,715 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-20 21:05:49,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 197 [2022-11-20 21:05:49,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:49,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:49,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:50,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:50,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:50,040 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:50,042 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:50,044 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:50,045 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:50,123 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-20 21:05:50,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 197 [2022-11-20 21:05:50,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:50,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 21:05:50,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 21:05:50,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:50,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:50,381 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:50,383 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:50,384 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:50,386 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:50,388 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:50,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:50,449 INFO L350 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 23 treesize of output 11 [2022-11-20 21:05:50,460 INFO L350 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 19 treesize of output 11 [2022-11-20 21:05:50,473 INFO L350 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 19 treesize of output 11 [2022-11-20 21:05:50,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:50,734 INFO L350 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 133 treesize of output 117 [2022-11-20 21:05:50,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:05:50,755 INFO L350 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 0 case distinctions, treesize of input 129 treesize of output 117 [2022-11-20 21:05:50,767 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:05:50,770 INFO L350 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 0 case distinctions, treesize of input 121 treesize of output 109 [2022-11-20 21:05:50,822 INFO L350 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 [2022-11-20 21:05:50,838 INFO L350 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 [2022-11-20 21:05:50,852 INFO L350 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 [2022-11-20 21:05:50,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:05:50,981 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 21:05:50,981 INFO L350 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 15 treesize of output 7 [2022-11-20 21:05:50,999 INFO L350 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 5 [2022-11-20 21:05:51,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:05:51,023 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 21:05:51,024 INFO L350 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 15 treesize of output 7 [2022-11-20 21:05:51,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:51,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:51,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:05:51,173 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 21:05:51,174 INFO L350 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 15 treesize of output 7 [2022-11-20 21:05:51,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:05:51,196 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 21:05:51,196 INFO L350 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 15 treesize of output 7 [2022-11-20 21:05:51,208 INFO L350 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 5 [2022-11-20 21:05:51,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:51,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:51,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 21:05:51,645 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 20 for LOIs [2022-11-20 21:05:51,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 21:05:51,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:51,674 INFO L350 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 11 treesize of output 7 [2022-11-20 21:05:51,680 INFO L350 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 11 treesize of output 7 [2022-11-20 21:05:51,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 21:05:51,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:51,704 INFO L350 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 27 treesize of output 11 [2022-11-20 21:05:51,710 INFO L350 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 [2022-11-20 21:05:51,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:51,721 INFO L350 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 27 treesize of output 11 [2022-11-20 21:05:51,723 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 21:05:55,670 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2117#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_sll_circular_insert_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 1 |ULTIMATE.start_sll_circular_insert_~data#1|) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= 0 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4) |ULTIMATE.start_sll_circular_insert_~data#1|) (< |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| |#StackHeapBarrier|) (= (ite (and (not (= (mod |ULTIMATE.start_main_~len~0#1| 2) 0)) (< |ULTIMATE.start_main_~len~0#1| 0)) (+ (div |ULTIMATE.start_main_~len~0#1| 2) 1) (div |ULTIMATE.start_main_~len~0#1| 2)) |ULTIMATE.start_sll_circular_insert_#in~index#1|) (= |ULTIMATE.start_sll_circular_insert_~index#1| |ULTIMATE.start_sll_circular_insert_#in~index#1|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0)) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= (select |#length| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 8) (= |ULTIMATE.start_sll_circular_insert_#in~data#1| |ULTIMATE.start_sll_circular_insert_~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_insert_~head#1.offset|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_insert_#in~head#1.offset|) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1)) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_insert_#in~data#1| 1))' at error location [2022-11-20 21:05:55,671 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 21:05:55,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:05:55,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2022-11-20 21:05:55,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388167518] [2022-11-20 21:05:55,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:55,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 21:05:55,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:55,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 21:05:55,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1120, Unknown=3, NotChecked=210, Total=1482 [2022-11-20 21:05:55,674 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 24 states, 18 states have (on average 2.888888888888889) internal successors, (52), 21 states have internal predecessors, (52), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 21:05:56,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:56,174 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2022-11-20 21:05:56,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 21:05:56,176 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.888888888888889) internal successors, (52), 21 states have internal predecessors, (52), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 27 [2022-11-20 21:05:56,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:56,177 INFO L225 Difference]: With dead ends: 113 [2022-11-20 21:05:56,177 INFO L226 Difference]: Without dead ends: 113 [2022-11-20 21:05:56,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=199, Invalid=1450, Unknown=3, NotChecked=240, Total=1892 [2022-11-20 21:05:56,179 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 170 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 481 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:56,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 377 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 311 Invalid, 0 Unknown, 481 Unchecked, 0.3s Time] [2022-11-20 21:05:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-20 21:05:56,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 89. [2022-11-20 21:05:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:05:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2022-11-20 21:05:56,192 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 27 [2022-11-20 21:05:56,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:56,193 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2022-11-20 21:05:56,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.888888888888889) internal successors, (52), 21 states have internal predecessors, (52), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 21:05:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-11-20 21:05:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 21:05:56,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:56,196 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:56,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:56,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-20 21:05:56,402 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:05:56,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1349502892, now seen corresponding path program 1 times [2022-11-20 21:05:56,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:56,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432698097] [2022-11-20 21:05:56,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:56,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:05:57,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:57,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432698097] [2022-11-20 21:05:57,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432698097] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:57,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074284708] [2022-11-20 21:05:57,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:57,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:57,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:57,043 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:57,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 21:05:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:57,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 21:05:57,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:57,203 INFO L350 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 [2022-11-20 21:05:57,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:57,241 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_489 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_489))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-20 21:05:57,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:57,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 21:05:57,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:57,305 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_490 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_490) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-20 21:05:57,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:57,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 21:05:57,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:57,390 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_491 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_491))))) is different from true [2022-11-20 21:05:57,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:57,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 21:05:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 12 not checked. [2022-11-20 21:05:57,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:57,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074284708] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:57,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1392458459] [2022-11-20 21:05:57,534 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-20 21:05:57,534 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:05:57,534 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 21:05:57,534 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 21:05:57,534 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 21:05:57,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:57,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:57,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 21:05:57,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:57,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:57,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 21:05:57,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 21:05:57,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:57,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 21:05:57,609 INFO L350 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 11 treesize of output 7 [2022-11-20 21:05:57,613 INFO L350 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 11 treesize of output 7 [2022-11-20 21:05:57,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:57,622 INFO L350 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 27 treesize of output 11 [2022-11-20 21:05:57,627 INFO L350 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 [2022-11-20 21:05:57,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:57,633 INFO L350 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 27 treesize of output 11 [2022-11-20 21:05:57,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:57,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:57,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 21:05:57,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:57,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:57,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 21:05:57,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:57,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:57,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 21:05:57,854 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-20 21:05:57,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 197 [2022-11-20 21:05:57,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 21:05:57,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:58,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 21:05:58,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:58,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:58,033 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:58,034 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:58,037 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:58,038 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:58,041 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:58,108 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-20 21:05:58,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 197 [2022-11-20 21:05:58,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:58,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:58,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:58,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:58,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:05:58,360 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:58,362 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:58,364 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:58,367 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:05:58,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:58,414 INFO L350 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 23 treesize of output 11 [2022-11-20 21:05:58,437 INFO L350 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 19 treesize of output 11 [2022-11-20 21:05:58,449 INFO L350 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 19 treesize of output 11 [2022-11-20 21:05:58,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:58,640 INFO L350 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 133 treesize of output 117 [2022-11-20 21:05:58,650 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:05:58,651 INFO L350 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 0 case distinctions, treesize of input 129 treesize of output 117 [2022-11-20 21:05:58,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:05:58,662 INFO L350 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 0 case distinctions, treesize of input 125 treesize of output 113 [2022-11-20 21:05:58,713 INFO L350 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 [2022-11-20 21:05:58,728 INFO L350 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 [2022-11-20 21:05:58,745 INFO L350 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 [2022-11-20 21:05:58,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:58,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:05:58,887 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 21:05:58,888 INFO L350 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 15 treesize of output 7 [2022-11-20 21:05:58,899 INFO L350 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 5 [2022-11-20 21:05:58,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:05:58,925 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 21:05:58,925 INFO L350 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 15 treesize of output 7 [2022-11-20 21:05:59,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:05:59,067 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 21:05:59,067 INFO L350 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 15 treesize of output 7 [2022-11-20 21:05:59,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:05:59,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:05:59,098 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 21:05:59,099 INFO L350 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 15 treesize of output 7 [2022-11-20 21:05:59,110 INFO L350 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 5 [2022-11-20 21:05:59,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:59,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:59,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 21:05:59,515 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 20 for LOIs [2022-11-20 21:05:59,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:59,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 21:05:59,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 21:05:59,554 INFO L350 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 11 treesize of output 7 [2022-11-20 21:05:59,559 INFO L350 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 11 treesize of output 7 [2022-11-20 21:05:59,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:59,578 INFO L350 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 27 treesize of output 11 [2022-11-20 21:05:59,585 INFO L350 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 [2022-11-20 21:05:59,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:05:59,593 INFO L350 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 27 treesize of output 11 [2022-11-20 21:05:59,610 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 21:06:03,393 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2454#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_sll_circular_insert_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 1 |ULTIMATE.start_sll_circular_insert_~data#1|) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (< (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|) (+ |ULTIMATE.start_sll_circular_insert_~head#1.offset| 4)) (<= 0 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4) |ULTIMATE.start_sll_circular_insert_~data#1|) (< |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| |#StackHeapBarrier|) (= (ite (and (not (= (mod |ULTIMATE.start_main_~len~0#1| 2) 0)) (< |ULTIMATE.start_main_~len~0#1| 0)) (+ (div |ULTIMATE.start_main_~len~0#1| 2) 1) (div |ULTIMATE.start_main_~len~0#1| 2)) |ULTIMATE.start_sll_circular_insert_#in~index#1|) (= |ULTIMATE.start_sll_circular_insert_~index#1| |ULTIMATE.start_sll_circular_insert_#in~index#1|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0)) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= (select |#length| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 8) (= |ULTIMATE.start_sll_circular_insert_#in~data#1| |ULTIMATE.start_sll_circular_insert_~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_insert_~head#1.offset|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_insert_#in~head#1.offset|) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_insert_~head#1.base|) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_insert_#in~data#1| 1))' at error location [2022-11-20 21:06:03,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 21:06:03,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:06:03,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2022-11-20 21:06:03,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083649268] [2022-11-20 21:06:03,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:06:03,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 21:06:03,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:03,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 21:06:03,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1013, Unknown=3, NotChecked=198, Total=1332 [2022-11-20 21:06:03,396 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 20 states, 13 states have (on average 3.076923076923077) internal successors, (40), 17 states have internal predecessors, (40), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 21:06:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:04,022 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2022-11-20 21:06:04,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 21:06:04,023 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 13 states have (on average 3.076923076923077) internal successors, (40), 17 states have internal predecessors, (40), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2022-11-20 21:06:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:04,024 INFO L225 Difference]: With dead ends: 98 [2022-11-20 21:06:04,024 INFO L226 Difference]: Without dead ends: 98 [2022-11-20 21:06:04,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=157, Invalid=1258, Unknown=3, NotChecked=222, Total=1640 [2022-11-20 21:06:04,025 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 457 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 309 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:04,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 246 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 469 Invalid, 0 Unknown, 309 Unchecked, 0.5s Time] [2022-11-20 21:06:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-20 21:06:04,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2022-11-20 21:06:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 48 states have (on average 1.75) internal successors, (84), 76 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:06:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2022-11-20 21:06:04,029 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 27 [2022-11-20 21:06:04,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:04,030 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2022-11-20 21:06:04,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 13 states have (on average 3.076923076923077) internal successors, (40), 17 states have internal predecessors, (40), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 21:06:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2022-11-20 21:06:04,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 21:06:04,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:04,031 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:04,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 21:06:04,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 21:06:04,236 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:06:04,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:04,237 INFO L85 PathProgramCache]: Analyzing trace with hash 208015655, now seen corresponding path program 1 times [2022-11-20 21:06:04,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:04,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973064601] [2022-11-20 21:06:04,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:04,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 21:06:04,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:04,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973064601] [2022-11-20 21:06:04,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973064601] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:06:04,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250907590] [2022-11-20 21:06:04,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:04,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:04,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:06:04,836 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:06:04,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 21:06:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:05,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-20 21:06:05,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:06:05,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-20 21:06:05,221 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_609 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_609))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_607 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_607))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-20 21:06:05,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:05,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 21:06:05,252 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-20 21:06:05,253 INFO L350 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 21 treesize of output 29 [2022-11-20 21:06:05,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 21:06:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 21:06:05,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 21:06:05,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250907590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:06:05,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 21:06:05,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 21 [2022-11-20 21:06:05,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355899858] [2022-11-20 21:06:05,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:06:05,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 21:06:05,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:05,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 21:06:05,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=365, Unknown=2, NotChecked=38, Total=462 [2022-11-20 21:06:05,295 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 11 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 21:06:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:05,555 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2022-11-20 21:06:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 21:06:05,555 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-11-20 21:06:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:05,556 INFO L225 Difference]: With dead ends: 145 [2022-11-20 21:06:05,556 INFO L226 Difference]: Without dead ends: 145 [2022-11-20 21:06:05,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=436, Unknown=2, NotChecked=42, Total=552 [2022-11-20 21:06:05,557 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 102 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:05,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 284 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 274 Invalid, 0 Unknown, 194 Unchecked, 0.2s Time] [2022-11-20 21:06:05,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-20 21:06:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 83. [2022-11-20 21:06:05,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.76) internal successors, (88), 78 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:06:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2022-11-20 21:06:05,562 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 29 [2022-11-20 21:06:05,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:05,562 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2022-11-20 21:06:05,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 21:06:05,563 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2022-11-20 21:06:05,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 21:06:05,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:05,563 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:05,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 21:06:05,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:05,770 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:06:05,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:05,771 INFO L85 PathProgramCache]: Analyzing trace with hash 208015656, now seen corresponding path program 1 times [2022-11-20 21:06:05,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:05,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125223660] [2022-11-20 21:06:05,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:05,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:06:06,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:06,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125223660] [2022-11-20 21:06:06,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125223660] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:06:06,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673931868] [2022-11-20 21:06:06,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:06,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:06,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:06:06,737 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:06:06,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 21:06:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:06,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-20 21:06:06,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:06:06,952 INFO L350 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 [2022-11-20 21:06:06,956 INFO L350 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 [2022-11-20 21:06:07,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-20 21:06:07,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:06:07,420 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_727 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_727) |c_#memory_$Pointer$.base|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_724 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_724) |c_#length|)) (exists ((v_ArrVal_728 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_728))))) is different from true [2022-11-20 21:06:07,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:07,438 INFO L350 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 14 treesize of output 16 [2022-11-20 21:06:07,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:07,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 21:06:07,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:07,454 INFO L350 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 25 treesize of output 25 [2022-11-20 21:06:07,465 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 21:06:07,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-20 21:06:07,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 21:06:07,521 INFO L350 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 15 treesize of output 7 [2022-11-20 21:06:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-20 21:06:07,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:06:08,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673931868] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:06:08,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1856012379] [2022-11-20 21:06:08,578 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-20 21:06:08,578 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:06:08,579 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 21:06:08,579 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 21:06:08,579 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 21:06:08,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:08,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:08,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 21:06:08,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:08,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:08,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 21:06:08,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:06:08,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 21:06:08,645 INFO L350 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 11 treesize of output 7 [2022-11-20 21:06:08,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 21:06:08,654 INFO L350 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 11 treesize of output 7 [2022-11-20 21:06:08,662 INFO L350 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 [2022-11-20 21:06:08,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:08,668 INFO L350 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 27 treesize of output 11 [2022-11-20 21:06:08,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:08,674 INFO L350 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 27 treesize of output 11 [2022-11-20 21:06:08,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:08,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:08,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 21:06:08,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:08,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:08,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 21:06:08,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:08,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:08,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 21:06:08,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:08,825 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 21:06:08,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-20 21:06:08,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:06:08,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:06:08,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:06:08,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:06:08,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:06:08,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:08,917 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 21:06:08,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-20 21:06:08,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:06:08,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:06:08,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:06:08,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:06:08,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:06:09,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:06:09,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:09,081 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 234 [2022-11-20 21:06:09,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:06:09,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 236 [2022-11-20 21:06:09,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:06:09,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 244 [2022-11-20 21:06:09,266 INFO L350 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 19 treesize of output 11 [2022-11-20 21:06:09,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:09,277 INFO L350 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 23 treesize of output 11 [2022-11-20 21:06:09,286 INFO L350 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 19 treesize of output 11 [2022-11-20 21:06:09,471 INFO L350 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 [2022-11-20 21:06:09,492 INFO L350 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 [2022-11-20 21:06:09,503 INFO L350 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 [2022-11-20 21:06:09,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:06:09,587 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 21:06:09,587 INFO L350 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 15 treesize of output 7 [2022-11-20 21:06:09,599 INFO L350 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 5 [2022-11-20 21:06:09,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:06:09,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:06:09,628 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 21:06:09,629 INFO L350 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 15 treesize of output 7 [2022-11-20 21:06:09,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:06:09,705 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 21:06:09,706 INFO L350 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 15 treesize of output 7 [2022-11-20 21:06:09,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 21:06:09,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:06:09,739 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 21:06:09,740 INFO L350 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 15 treesize of output 7 [2022-11-20 21:06:09,758 INFO L350 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 5 [2022-11-20 21:06:09,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:09,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:09,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 21:06:09,954 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 20 for LOIs [2022-11-20 21:06:09,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 21:06:09,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:06:09,981 INFO L350 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 11 treesize of output 7 [2022-11-20 21:06:09,986 INFO L350 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 11 treesize of output 7 [2022-11-20 21:06:09,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 21:06:10,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:10,007 INFO L350 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 27 treesize of output 11 [2022-11-20 21:06:10,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:10,015 INFO L350 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 27 treesize of output 11 [2022-11-20 21:06:10,022 INFO L350 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 [2022-11-20 21:06:10,034 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 21:06:15,459 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3124#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (<= |ULTIMATE.start_sll_circular_insert_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_insert_~data#1|) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1) (<= 0 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|) (< 0 |ULTIMATE.start_sll_circular_insert_~index#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4) |ULTIMATE.start_sll_circular_insert_~data#1|) (< |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| |#StackHeapBarrier|) (= (ite (and (not (= (mod |ULTIMATE.start_main_~len~0#1| 2) 0)) (< |ULTIMATE.start_main_~len~0#1| 0)) (+ (div |ULTIMATE.start_main_~len~0#1| 2) 1) (div |ULTIMATE.start_main_~len~0#1| 2)) |ULTIMATE.start_sll_circular_insert_#in~index#1|) (= |ULTIMATE.start_sll_circular_insert_~index#1| |ULTIMATE.start_sll_circular_insert_#in~index#1|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (or (not (<= 0 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)) (not (<= (+ |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|)))) (<= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0)) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= (select |#length| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 8) (= |ULTIMATE.start_sll_circular_insert_#in~data#1| |ULTIMATE.start_sll_circular_insert_~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_insert_~head#1.offset|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (<= |#NULL.base| 0) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) |ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (<= (+ |ULTIMATE.start_sll_circular_insert_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_insert_#in~head#1.offset|) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_insert_~head#1.base|) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_insert_#in~data#1| 1))' at error location [2022-11-20 21:06:15,459 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 21:06:15,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:06:15,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2022-11-20 21:06:15,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126633332] [2022-11-20 21:06:15,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:06:15,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 21:06:15,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:15,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 21:06:15,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2007, Unknown=2, NotChecked=90, Total=2256 [2022-11-20 21:06:15,462 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 28 states, 21 states have (on average 2.0) internal successors, (42), 24 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 21:06:16,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:16,684 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2022-11-20 21:06:16,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 21:06:16,685 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.0) internal successors, (42), 24 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2022-11-20 21:06:16,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:16,686 INFO L225 Difference]: With dead ends: 144 [2022-11-20 21:06:16,686 INFO L226 Difference]: Without dead ends: 144 [2022-11-20 21:06:16,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=229, Invalid=2851, Unknown=4, NotChecked=108, Total=3192 [2022-11-20 21:06:16,687 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 211 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:16,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 610 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 651 Invalid, 0 Unknown, 215 Unchecked, 0.6s Time] [2022-11-20 21:06:16,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-20 21:06:16,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 83. [2022-11-20 21:06:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.74) internal successors, (87), 78 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:06:16,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2022-11-20 21:06:16,693 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 29 [2022-11-20 21:06:16,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:16,695 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2022-11-20 21:06:16,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.0) internal successors, (42), 24 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 21:06:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2022-11-20 21:06:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 21:06:16,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:16,702 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:16,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 21:06:16,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:16,909 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:06:16,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:16,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2141279848, now seen corresponding path program 1 times [2022-11-20 21:06:16,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:16,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715888696] [2022-11-20 21:06:16,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:16,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 21:06:16,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:16,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715888696] [2022-11-20 21:06:16,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715888696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:06:16,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:06:16,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 21:06:16,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654307726] [2022-11-20 21:06:16,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:06:16,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 21:06:16,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:16,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 21:06:16,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:06:16,974 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 21:06:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:17,018 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2022-11-20 21:06:17,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 21:06:17,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2022-11-20 21:06:17,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:17,019 INFO L225 Difference]: With dead ends: 123 [2022-11-20 21:06:17,020 INFO L226 Difference]: Without dead ends: 123 [2022-11-20 21:06:17,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:06:17,021 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 58 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:17,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 161 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 21:06:17,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-20 21:06:17,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2022-11-20 21:06:17,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 79 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:06:17,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2022-11-20 21:06:17,028 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 30 [2022-11-20 21:06:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:17,029 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2022-11-20 21:06:17,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 21:06:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2022-11-20 21:06:17,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 21:06:17,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:17,032 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:17,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 21:06:17,032 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:06:17,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:17,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1960260436, now seen corresponding path program 1 times [2022-11-20 21:06:17,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:17,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630929584] [2022-11-20 21:06:17,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:17,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:17,188 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 21:06:17,189 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:17,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630929584] [2022-11-20 21:06:17,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630929584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:06:17,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:06:17,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 21:06:17,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796077842] [2022-11-20 21:06:17,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:06:17,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 21:06:17,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:17,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 21:06:17,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 21:06:17,191 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 21:06:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:17,242 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2022-11-20 21:06:17,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 21:06:17,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-11-20 21:06:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:17,245 INFO L225 Difference]: With dead ends: 81 [2022-11-20 21:06:17,245 INFO L226 Difference]: Without dead ends: 81 [2022-11-20 21:06:17,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 21:06:17,246 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 202 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:17,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 86 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 21:06:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-20 21:06:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-20 21:06:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.68) internal successors, (84), 76 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:06:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2022-11-20 21:06:17,249 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 31 [2022-11-20 21:06:17,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:17,250 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2022-11-20 21:06:17,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 21:06:17,250 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2022-11-20 21:06:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 21:06:17,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:17,252 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:17,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 21:06:17,252 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:06:17,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:17,253 INFO L85 PathProgramCache]: Analyzing trace with hash -638361933, now seen corresponding path program 1 times [2022-11-20 21:06:17,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:17,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728387341] [2022-11-20 21:06:17,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:17,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 21:06:17,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:17,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728387341] [2022-11-20 21:06:17,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728387341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:06:17,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:06:17,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 21:06:17,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795287568] [2022-11-20 21:06:17,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:06:17,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 21:06:17,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:17,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 21:06:17,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:06:17,333 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 21:06:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:17,456 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2022-11-20 21:06:17,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 21:06:17,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-11-20 21:06:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:17,458 INFO L225 Difference]: With dead ends: 131 [2022-11-20 21:06:17,458 INFO L226 Difference]: Without dead ends: 131 [2022-11-20 21:06:17,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:06:17,459 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 59 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:17,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 140 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:06:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-20 21:06:17,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 80. [2022-11-20 21:06:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.66) internal successors, (83), 75 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:06:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-11-20 21:06:17,462 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 32 [2022-11-20 21:06:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:17,462 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-11-20 21:06:17,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 21:06:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-11-20 21:06:17,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 21:06:17,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:17,463 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:17,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 21:06:17,463 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:06:17,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:17,463 INFO L85 PathProgramCache]: Analyzing trace with hash -638361932, now seen corresponding path program 1 times [2022-11-20 21:06:17,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:17,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033815434] [2022-11-20 21:06:17,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:17,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 21:06:17,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:17,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033815434] [2022-11-20 21:06:17,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033815434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:06:17,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:06:17,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 21:06:17,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124279577] [2022-11-20 21:06:17,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:06:17,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 21:06:17,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:17,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 21:06:17,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:06:17,593 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 21:06:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:17,710 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2022-11-20 21:06:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 21:06:17,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-11-20 21:06:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:17,712 INFO L225 Difference]: With dead ends: 132 [2022-11-20 21:06:17,712 INFO L226 Difference]: Without dead ends: 132 [2022-11-20 21:06:17,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:06:17,713 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 62 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:17,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 160 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:06:17,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-20 21:06:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 79. [2022-11-20 21:06:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.64) internal successors, (82), 74 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:06:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2022-11-20 21:06:17,716 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 32 [2022-11-20 21:06:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:17,716 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2022-11-20 21:06:17,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 21:06:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-11-20 21:06:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 21:06:17,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:17,717 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:17,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 21:06:17,717 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:06:17,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash -480351431, now seen corresponding path program 1 times [2022-11-20 21:06:17,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:17,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133369612] [2022-11-20 21:06:17,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:17,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 21:06:17,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:17,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133369612] [2022-11-20 21:06:17,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133369612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:06:17,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:06:17,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 21:06:17,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487375506] [2022-11-20 21:06:17,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:06:17,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 21:06:17,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:17,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 21:06:17,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 21:06:17,818 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 21:06:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:17,974 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-11-20 21:06:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 21:06:17,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-11-20 21:06:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:17,975 INFO L225 Difference]: With dead ends: 93 [2022-11-20 21:06:17,975 INFO L226 Difference]: Without dead ends: 93 [2022-11-20 21:06:17,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 21:06:17,976 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 57 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:17,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 161 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:06:17,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-20 21:06:17,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 76. [2022-11-20 21:06:17,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 71 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:06:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2022-11-20 21:06:17,979 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 32 [2022-11-20 21:06:17,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:17,979 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-11-20 21:06:17,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 21:06:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-11-20 21:06:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 21:06:17,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:17,980 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:17,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 21:06:17,980 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:06:17,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:17,981 INFO L85 PathProgramCache]: Analyzing trace with hash -480351430, now seen corresponding path program 1 times [2022-11-20 21:06:17,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:17,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942226923] [2022-11-20 21:06:17,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 21:06:18,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:18,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942226923] [2022-11-20 21:06:18,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942226923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:06:18,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:06:18,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 21:06:18,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555130006] [2022-11-20 21:06:18,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:06:18,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 21:06:18,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:18,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 21:06:18,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:06:18,112 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 21:06:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:18,156 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-11-20 21:06:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 21:06:18,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-11-20 21:06:18,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:18,158 INFO L225 Difference]: With dead ends: 75 [2022-11-20 21:06:18,158 INFO L226 Difference]: Without dead ends: 75 [2022-11-20 21:06:18,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 21:06:18,159 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 67 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:18,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 130 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 21:06:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-20 21:06:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-20 21:06:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.5714285714285714) internal successors, (77), 70 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:06:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-11-20 21:06:18,163 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 32 [2022-11-20 21:06:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:18,163 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-11-20 21:06:18,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 21:06:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-11-20 21:06:18,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 21:06:18,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:18,164 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:18,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 21:06:18,164 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:06:18,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:18,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1685616585, now seen corresponding path program 1 times [2022-11-20 21:06:18,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:18,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838730417] [2022-11-20 21:06:18,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:18,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 21:06:18,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:18,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838730417] [2022-11-20 21:06:18,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838730417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:06:18,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:06:18,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 21:06:18,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257068162] [2022-11-20 21:06:18,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:06:18,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 21:06:18,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:18,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 21:06:18,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 21:06:18,372 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 21:06:18,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:18,513 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2022-11-20 21:06:18,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 21:06:18,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-11-20 21:06:18,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:18,514 INFO L225 Difference]: With dead ends: 72 [2022-11-20 21:06:18,514 INFO L226 Difference]: Without dead ends: 72 [2022-11-20 21:06:18,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 21:06:18,515 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 56 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:18,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 178 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:06:18,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-20 21:06:18,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-20 21:06:18,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.510204081632653) internal successors, (74), 67 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:06:18,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2022-11-20 21:06:18,518 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 33 [2022-11-20 21:06:18,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:18,519 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2022-11-20 21:06:18,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 21:06:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-11-20 21:06:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 21:06:18,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:18,520 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:18,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 21:06:18,520 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:06:18,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:18,521 INFO L85 PathProgramCache]: Analyzing trace with hash 674868617, now seen corresponding path program 1 times [2022-11-20 21:06:18,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:18,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777518856] [2022-11-20 21:06:18,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:18,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 21:06:18,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:18,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777518856] [2022-11-20 21:06:18,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777518856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:06:18,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:06:18,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 21:06:18,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325489549] [2022-11-20 21:06:18,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:06:18,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 21:06:18,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:18,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 21:06:18,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:06:18,615 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 21:06:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:18,690 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2022-11-20 21:06:18,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 21:06:18,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-11-20 21:06:18,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:18,692 INFO L225 Difference]: With dead ends: 88 [2022-11-20 21:06:18,692 INFO L226 Difference]: Without dead ends: 88 [2022-11-20 21:06:18,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 21:06:18,693 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 123 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:18,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 72 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:06:18,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-20 21:06:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2022-11-20 21:06:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.489795918367347) internal successors, (73), 66 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 21:06:18,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2022-11-20 21:06:18,696 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 35 [2022-11-20 21:06:18,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:18,696 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2022-11-20 21:06:18,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 21:06:18,697 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-11-20 21:06:18,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 21:06:18,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:18,697 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:18,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 21:06:18,698 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-20 21:06:18,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:18,698 INFO L85 PathProgramCache]: Analyzing trace with hash -553905439, now seen corresponding path program 1 times [2022-11-20 21:06:18,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:18,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293189354] [2022-11-20 21:06:18,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:18,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:19,443 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 21:06:19,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:19,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293189354] [2022-11-20 21:06:19,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293189354] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:06:19,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662866415] [2022-11-20 21:06:19,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:19,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:19,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:06:19,446 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:06:19,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4822d51-4157-4cbe-91e4-f2cc84c6c4e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 21:06:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:19,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-20 21:06:19,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:06:19,701 INFO L350 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 [2022-11-20 21:06:19,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-20 21:06:19,981 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1344 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1344) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1343 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1343)))) is different from true [2022-11-20 21:06:20,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:20,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 21:06:20,054 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 21:06:20,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-20 21:06:20,356 INFO L321 Elim1Store]: treesize reduction 32, result has 57.3 percent of original size [2022-11-20 21:06:20,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 62 [2022-11-20 21:06:21,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:06:22,949 INFO L321 Elim1Store]: treesize reduction 216, result has 74.7 percent of original size [2022-11-20 21:06:22,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 17 new quantified variables, introduced 90 case distinctions, treesize of input 173 treesize of output 791