./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8 --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- 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-2329fc7 [2022-12-13 19:58:31,759 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:58:31,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:58:31,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:58:31,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:58:31,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:58:31,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:58:31,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:58:31,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:58:31,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:58:31,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:58:31,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:58:31,780 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:58:31,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:58:31,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:58:31,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:58:31,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:58:31,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:58:31,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:58:31,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:58:31,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:58:31,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:58:31,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:58:31,789 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:58:31,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:58:31,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:58:31,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:58:31,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:58:31,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:58:31,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:58:31,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:58:31,793 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:58:31,794 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:58:31,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:58:31,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:58:31,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:58:31,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:58:31,796 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:58:31,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:58:31,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:58:31,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:58:31,797 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 19:58:31,811 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:58:31,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:58:31,812 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:58:31,812 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:58:31,812 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:58:31,813 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:58:31,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:58:31,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:58:31,814 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:58:31,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:58:31,814 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:58:31,814 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 19:58:31,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:58:31,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:58:31,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:58:31,815 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 19:58:31,815 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 19:58:31,815 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 19:58:31,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:58:31,815 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 19:58:31,815 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:58:31,815 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:58:31,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:58:31,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:58:31,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:58:31,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:58:31,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:58:31,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:58:31,816 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:58:31,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:58:31,817 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:58:31,817 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:58:31,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:58:31,817 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:58:31,817 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/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_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8 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 -> Automizer 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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2022-12-13 19:58:31,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:58:32,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:58:32,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:58:32,008 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:58:32,008 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:58:32,010 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2022-12-13 19:58:34,623 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:58:34,778 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:58:34,778 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2022-12-13 19:58:34,786 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/data/febc8ba63/37d3f1f417f34cada99de715c0fae26a/FLAG505282ff4 [2022-12-13 19:58:34,796 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/data/febc8ba63/37d3f1f417f34cada99de715c0fae26a [2022-12-13 19:58:34,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:58:34,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:58:34,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:58:34,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:58:34,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:58:34,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:58:34" (1/1) ... [2022-12-13 19:58:34,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff51459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:58:34, skipping insertion in model container [2022-12-13 19:58:34,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:58:34" (1/1) ... [2022-12-13 19:58:34,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:58:34,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:58:35,070 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_d9f68331-6e4e-410a-8f96-48e26c8e1896/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2022-12-13 19:58:35,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:58:35,078 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:58:35,103 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_d9f68331-6e4e-410a-8f96-48e26c8e1896/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2022-12-13 19:58:35,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:58:35,120 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:58:35,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:58:35 WrapperNode [2022-12-13 19:58:35,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:58:35,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:58:35,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:58:35,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:58:35,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:58:35" (1/1) ... [2022-12-13 19:58:35,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:58:35" (1/1) ... [2022-12-13 19:58:35,150 INFO L138 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 106 [2022-12-13 19:58:35,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:58:35,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:58:35,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:58:35,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:58:35,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:58:35" (1/1) ... [2022-12-13 19:58:35,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:58:35" (1/1) ... [2022-12-13 19:58:35,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:58:35" (1/1) ... [2022-12-13 19:58:35,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:58:35" (1/1) ... [2022-12-13 19:58:35,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:58:35" (1/1) ... [2022-12-13 19:58:35,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:58:35" (1/1) ... [2022-12-13 19:58:35,168 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:58:35" (1/1) ... [2022-12-13 19:58:35,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:58:35" (1/1) ... [2022-12-13 19:58:35,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:58:35,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:58:35,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:58:35,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:58:35,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:58:35" (1/1) ... [2022-12-13 19:58:35,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:58:35,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:58:35,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:58:35,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:58:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 19:58:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 19:58:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-13 19:58:35,224 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-13 19:58:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 19:58:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:58:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 19:58:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 19:58:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 19:58:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 19:58:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 19:58:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:58:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:58:35,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:58:35,315 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:58:35,316 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:58:35,531 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:58:35,536 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:58:35,536 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 19:58:35,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:58:35 BoogieIcfgContainer [2022-12-13 19:58:35,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:58:35,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:58:35,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:58:35,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:58:35,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:58:34" (1/3) ... [2022-12-13 19:58:35,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e97403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:58:35, skipping insertion in model container [2022-12-13 19:58:35,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:58:35" (2/3) ... [2022-12-13 19:58:35,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e97403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:58:35, skipping insertion in model container [2022-12-13 19:58:35,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:58:35" (3/3) ... [2022-12-13 19:58:35,544 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2022-12-13 19:58:35,559 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:58:35,559 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-12-13 19:58:35,592 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:58:35,597 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=PETRI_NET, 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;@1dedbd40, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:58:35,597 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-12-13 19:58:35,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:58:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 19:58:35,606 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:58:35,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:58:35,606 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:58:35,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:35,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1813073593, now seen corresponding path program 1 times [2022-12-13 19:58:35,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:58:35,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834691057] [2022-12-13 19:58:35,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:35,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:58:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:58:35,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:58:35,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834691057] [2022-12-13 19:58:35,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834691057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:58:35,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:58:35,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:58:35,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814163816] [2022-12-13 19:58:35,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:58:35,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:58:35,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:58:35,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:58:35,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:58:35,888 INFO L87 Difference]: Start difference. First operand has 73 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12-13 19:58:35,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:58:35,971 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-12-13 19:58:35,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:58:35,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (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 7 [2022-12-13 19:58:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:58:35,982 INFO L225 Difference]: With dead ends: 71 [2022-12-13 19:58:35,982 INFO L226 Difference]: Without dead ends: 68 [2022-12-13 19:58:35,983 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-12-13 19:58:35,986 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:58:35,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:58:35,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-13 19:58:36,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-12-13 19:58:36,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.7) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:58:36,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-12-13 19:58:36,014 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 7 [2022-12-13 19:58:36,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:58:36,014 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-12-13 19:58:36,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (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-12-13 19:58:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-12-13 19:58:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 19:58:36,015 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:58:36,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:58:36,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:58:36,015 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:58:36,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:36,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1813073594, now seen corresponding path program 1 times [2022-12-13 19:58:36,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:58:36,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839283025] [2022-12-13 19:58:36,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:36,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:58:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:58:36,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:58:36,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839283025] [2022-12-13 19:58:36,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839283025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:58:36,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:58:36,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:58:36,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205160821] [2022-12-13 19:58:36,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:58:36,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:58:36,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:58:36,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:58:36,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:58:36,111 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (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-12-13 19:58:36,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:58:36,157 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-12-13 19:58:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:58:36,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (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 7 [2022-12-13 19:58:36,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:58:36,158 INFO L225 Difference]: With dead ends: 66 [2022-12-13 19:58:36,158 INFO L226 Difference]: Without dead ends: 66 [2022-12-13 19:58:36,159 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-12-13 19:58:36,160 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:58:36,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 108 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:58:36,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-13 19:58:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-12-13 19:58:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.65) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:58:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-12-13 19:58:36,167 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 7 [2022-12-13 19:58:36,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:58:36,167 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-12-13 19:58:36,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (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-12-13 19:58:36,167 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-12-13 19:58:36,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 19:58:36,168 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:58:36,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:58:36,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 19:58:36,168 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:58:36,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:36,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1431584192, now seen corresponding path program 1 times [2022-12-13 19:58:36,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:58:36,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511644547] [2022-12-13 19:58:36,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:36,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:58:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:36,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:58:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:58:36,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:58:36,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511644547] [2022-12-13 19:58:36,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511644547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:58:36,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:58:36,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 19:58:36,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880160703] [2022-12-13 19:58:36,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:58:36,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:58:36,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:58:36,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:58:36,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:58:36,333 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-12-13 19:58:36,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:58:36,470 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-12-13 19:58:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 19:58:36,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2022-12-13 19:58:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:58:36,473 INFO L225 Difference]: With dead ends: 70 [2022-12-13 19:58:36,473 INFO L226 Difference]: Without dead ends: 70 [2022-12-13 19:58:36,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 19:58:36,474 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 11 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:58:36,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 249 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:58:36,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-13 19:58:36,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-12-13 19:58:36,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.625) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:58:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-12-13 19:58:36,482 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 13 [2022-12-13 19:58:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:58:36,483 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-12-13 19:58:36,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-12-13 19:58:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-12-13 19:58:36,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 19:58:36,483 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:58:36,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:58:36,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 19:58:36,484 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:58:36,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:36,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1431584193, now seen corresponding path program 1 times [2022-12-13 19:58:36,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:58:36,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274983616] [2022-12-13 19:58:36,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:36,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:58:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:36,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:58:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:58:36,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:58:36,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274983616] [2022-12-13 19:58:36,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274983616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:58:36,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:58:36,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 19:58:36,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355070760] [2022-12-13 19:58:36,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:58:36,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:58:36,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:58:36,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:58:36,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:58:36,687 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-12-13 19:58:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:58:36,820 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-12-13 19:58:36,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 19:58:36,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2022-12-13 19:58:36,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:58:36,821 INFO L225 Difference]: With dead ends: 69 [2022-12-13 19:58:36,821 INFO L226 Difference]: Without dead ends: 69 [2022-12-13 19:58:36,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 19:58:36,823 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 9 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:58:36,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 265 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:58:36,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-13 19:58:36,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2022-12-13 19:58:36,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.6) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:58:36,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-12-13 19:58:36,828 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 13 [2022-12-13 19:58:36,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:58:36,829 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-12-13 19:58:36,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-12-13 19:58:36,829 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-12-13 19:58:36,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 19:58:36,830 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:58:36,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:58:36,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 19:58:36,830 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:58:36,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:36,830 INFO L85 PathProgramCache]: Analyzing trace with hash 869381824, now seen corresponding path program 1 times [2022-12-13 19:58:36,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:58:36,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325784876] [2022-12-13 19:58:36,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:36,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:58:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:36,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 19:58:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:58:36,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:58:36,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325784876] [2022-12-13 19:58:36,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325784876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:58:36,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:58:36,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:58:36,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770467570] [2022-12-13 19:58:36,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:58:36,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:58:36,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:58:36,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:58:36,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:58:36,891 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-12-13 19:58:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:58:36,942 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-12-13 19:58:36,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:58:36,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2022-12-13 19:58:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:58:36,943 INFO L225 Difference]: With dead ends: 70 [2022-12-13 19:58:36,943 INFO L226 Difference]: Without dead ends: 70 [2022-12-13 19:58:36,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-12-13 19:58:36,944 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:58:36,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 159 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:58:36,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-13 19:58:36,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-12-13 19:58:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:58:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-12-13 19:58:36,948 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 15 [2022-12-13 19:58:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:58:36,948 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-12-13 19:58:36,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-12-13 19:58:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-12-13 19:58:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 19:58:36,950 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:58:36,950 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:58:36,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 19:58:36,950 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:58:36,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:36,950 INFO L85 PathProgramCache]: Analyzing trace with hash -206453950, now seen corresponding path program 1 times [2022-12-13 19:58:36,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:58:36,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887008932] [2022-12-13 19:58:36,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:36,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:58:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:37,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:58:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:37,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 19:58:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 19:58:37,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:58:37,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887008932] [2022-12-13 19:58:37,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887008932] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:58:37,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168076323] [2022-12-13 19:58:37,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:37,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:58:37,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:58:37,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:58:37,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 19:58:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:37,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 19:58:37,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:58:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:58:37,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:58:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 19:58:37,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168076323] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:58:37,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:58:37,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-12-13 19:58:37,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108463527] [2022-12-13 19:58:37,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:58:37,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 19:58:37,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:58:37,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 19:58:37,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:58:37,196 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 19:58:37,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:58:37,250 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-12-13 19:58:37,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:58:37,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-12-13 19:58:37,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:58:37,251 INFO L225 Difference]: With dead ends: 71 [2022-12-13 19:58:37,252 INFO L226 Difference]: Without dead ends: 71 [2022-12-13 19:58:37,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:58:37,252 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:58:37,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 158 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:58:37,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-12-13 19:58:37,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-12-13 19:58:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 66 states have internal predecessors, (70), 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-12-13 19:58:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-12-13 19:58:37,256 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 28 [2022-12-13 19:58:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:58:37,256 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-12-13 19:58:37,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 19:58:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-12-13 19:58:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 19:58:37,257 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:58:37,257 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:58:37,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 19:58:37,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 19:58:37,459 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:58:37,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:37,461 INFO L85 PathProgramCache]: Analyzing trace with hash 400923136, now seen corresponding path program 2 times [2022-12-13 19:58:37,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:58:37,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894564326] [2022-12-13 19:58:37,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:37,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:58:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:37,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:58:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:37,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 19:58:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:37,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 19:58:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:37,994 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 19:58:37,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:58:37,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894564326] [2022-12-13 19:58:37,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894564326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:58:37,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:58:37,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 19:58:37,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925796396] [2022-12-13 19:58:37,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:58:37,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:58:37,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:58:37,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:58:37,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:58:37,996 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:58:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:58:38,115 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-12-13 19:58:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:58:38,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-12-13 19:58:38,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:58:38,116 INFO L225 Difference]: With dead ends: 79 [2022-12-13 19:58:38,116 INFO L226 Difference]: Without dead ends: 79 [2022-12-13 19:58:38,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 19:58:38,117 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 84 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:58:38,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 147 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:58:38,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-13 19:58:38,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2022-12-13 19:58:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.434782608695652) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:58:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2022-12-13 19:58:38,120 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 41 [2022-12-13 19:58:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:58:38,121 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2022-12-13 19:58:38,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:58:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-12-13 19:58:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 19:58:38,122 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:58:38,122 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:58:38,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 19:58:38,122 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:58:38,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:38,123 INFO L85 PathProgramCache]: Analyzing trace with hash 400923137, now seen corresponding path program 1 times [2022-12-13 19:58:38,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:58:38,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669767078] [2022-12-13 19:58:38,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:38,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:58:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:38,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:58:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:38,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 19:58:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:38,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 19:58:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 19:58:38,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:58:38,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669767078] [2022-12-13 19:58:38,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669767078] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:58:38,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259610824] [2022-12-13 19:58:38,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:38,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:58:38,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:58:38,640 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:58:38,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 19:58:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:38,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 19:58:38,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:58:38,784 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-12-13 19:58:38,812 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-12-13 19:58:38,836 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_452 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_452))))) is different from true [2022-12-13 19:58:38,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:38,885 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-12-13 19:58:38,921 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-12-13 19:58:38,930 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_453 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_453) |c_#length|)))) is different from true [2022-12-13 19:58:38,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:38,974 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-12-13 19:58:39,036 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-12-13 19:58:39,045 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_454 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_454) |c_#length|)))) is different from true [2022-12-13 19:58:39,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:39,083 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-12-13 19:58:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2022-12-13 19:58:39,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:58:41,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259610824] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:58:41,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:58:41,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2022-12-13 19:58:41,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303478539] [2022-12-13 19:58:41,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:58:41,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 19:58:41,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:58:41,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 19:58:41,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=225, Unknown=3, NotChecked=96, Total=380 [2022-12-13 19:58:41,201 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 19:58:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:58:41,461 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-12-13 19:58:41,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 19:58:41,461 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-12-13 19:58:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:58:41,462 INFO L225 Difference]: With dead ends: 75 [2022-12-13 19:58:41,462 INFO L226 Difference]: Without dead ends: 75 [2022-12-13 19:58:41,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=88, Invalid=341, Unknown=3, NotChecked=120, Total=552 [2022-12-13 19:58:41,463 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 251 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:58:41,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 144 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 177 Invalid, 0 Unknown, 162 Unchecked, 0.2s Time] [2022-12-13 19:58:41,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-13 19:58:41,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2022-12-13 19:58:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:58:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2022-12-13 19:58:41,469 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 41 [2022-12-13 19:58:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:58:41,469 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-12-13 19:58:41,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 19:58:41,470 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-12-13 19:58:41,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 19:58:41,471 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:58:41,471 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:58:41,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 19:58:41,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:58:41,672 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:58:41,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:41,672 INFO L85 PathProgramCache]: Analyzing trace with hash -456284671, now seen corresponding path program 1 times [2022-12-13 19:58:41,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:58:41,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548750349] [2022-12-13 19:58:41,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:41,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:58:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:41,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:58:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:41,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 19:58:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:41,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 19:58:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 19:58:41,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:58:41,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548750349] [2022-12-13 19:58:41,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548750349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:58:41,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:58:41,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 19:58:41,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280337057] [2022-12-13 19:58:41,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:58:41,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:58:41,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:58:41,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:58:41,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:58:41,856 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-12-13 19:58:41,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:58:41,941 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-12-13 19:58:41,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 19:58:41,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 42 [2022-12-13 19:58:41,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:58:41,942 INFO L225 Difference]: With dead ends: 62 [2022-12-13 19:58:41,942 INFO L226 Difference]: Without dead ends: 62 [2022-12-13 19:58:41,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 19:58:41,943 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 39 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:58:41,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 181 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:58:41,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-13 19:58:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-12-13 19:58:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.326086956521739) internal successors, (61), 57 states have internal predecessors, (61), 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-12-13 19:58:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-12-13 19:58:41,948 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 42 [2022-12-13 19:58:41,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:58:41,948 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-12-13 19:58:41,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-12-13 19:58:41,948 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-12-13 19:58:41,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 19:58:41,949 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:58:41,949 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:58:41,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 19:58:41,950 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:58:41,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:41,950 INFO L85 PathProgramCache]: Analyzing trace with hash -456284672, now seen corresponding path program 1 times [2022-12-13 19:58:41,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:58:41,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346960119] [2022-12-13 19:58:41,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:41,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:58:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:42,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:58:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:42,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 19:58:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:42,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 19:58:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 19:58:42,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:58:42,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346960119] [2022-12-13 19:58:42,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346960119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:58:42,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:58:42,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 19:58:42,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548755196] [2022-12-13 19:58:42,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:58:42,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:58:42,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:58:42,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:58:42,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:58:42,078 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-12-13 19:58:42,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:58:42,164 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2022-12-13 19:58:42,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 19:58:42,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 42 [2022-12-13 19:58:42,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:58:42,165 INFO L225 Difference]: With dead ends: 73 [2022-12-13 19:58:42,165 INFO L226 Difference]: Without dead ends: 73 [2022-12-13 19:58:42,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 19:58:42,166 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 36 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:58:42,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 174 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:58:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-12-13 19:58:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2022-12-13 19:58:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:58:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-12-13 19:58:42,169 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 42 [2022-12-13 19:58:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:58:42,169 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-12-13 19:58:42,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-12-13 19:58:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-12-13 19:58:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 19:58:42,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:58:42,170 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:58:42,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 19:58:42,170 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:58:42,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:42,171 INFO L85 PathProgramCache]: Analyzing trace with hash 866562379, now seen corresponding path program 1 times [2022-12-13 19:58:42,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:58:42,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293836369] [2022-12-13 19:58:42,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:42,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:58:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:42,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:58:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:42,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 19:58:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:42,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 19:58:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 19:58:42,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:58:42,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293836369] [2022-12-13 19:58:42,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293836369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:58:42,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:58:42,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 19:58:42,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858307429] [2022-12-13 19:58:42,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:58:42,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 19:58:42,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:58:42,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 19:58:42,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:58:42,390 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:58:42,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:58:42,538 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-12-13 19:58:42,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 19:58:42,538 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-12-13 19:58:42,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:58:42,539 INFO L225 Difference]: With dead ends: 92 [2022-12-13 19:58:42,539 INFO L226 Difference]: Without dead ends: 92 [2022-12-13 19:58:42,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-12-13 19:58:42,540 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 188 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:58:42,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 215 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:58:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-13 19:58:42,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2022-12-13 19:58:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.3125) internal successors, (63), 57 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:58:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-12-13 19:58:42,544 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 49 [2022-12-13 19:58:42,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:58:42,544 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-12-13 19:58:42,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:58:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-12-13 19:58:42,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 19:58:42,546 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:58:42,546 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:58:42,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 19:58:42,546 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:58:42,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:42,546 INFO L85 PathProgramCache]: Analyzing trace with hash 866562380, now seen corresponding path program 1 times [2022-12-13 19:58:42,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:58:42,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393187561] [2022-12-13 19:58:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:42,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:58:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:42,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:58:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:42,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 19:58:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:42,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 19:58:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:42,946 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 19:58:42,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:58:42,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393187561] [2022-12-13 19:58:42,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393187561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:58:42,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:58:42,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 19:58:42,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086124417] [2022-12-13 19:58:42,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:58:42,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 19:58:42,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:58:42,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 19:58:42,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:58:42,948 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:58:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:58:43,138 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-12-13 19:58:43,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 19:58:43,139 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-12-13 19:58:43,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:58:43,140 INFO L225 Difference]: With dead ends: 84 [2022-12-13 19:58:43,140 INFO L226 Difference]: Without dead ends: 84 [2022-12-13 19:58:43,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-12-13 19:58:43,141 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 189 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:58:43,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 233 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:58:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-12-13 19:58:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2022-12-13 19:58:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.28) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:58:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-12-13 19:58:43,144 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 49 [2022-12-13 19:58:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:58:43,144 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-12-13 19:58:43,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:58:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-12-13 19:58:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-13 19:58:43,144 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:58:43,145 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:58:43,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 19:58:43,145 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:58:43,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:43,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1093628647, now seen corresponding path program 1 times [2022-12-13 19:58:43,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:58:43,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212268428] [2022-12-13 19:58:43,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:43,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:58:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:43,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:58:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:43,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 19:58:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:43,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 19:58:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 19:58:43,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:58:43,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212268428] [2022-12-13 19:58:43,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212268428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:58:43,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:58:43,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 19:58:43,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848555649] [2022-12-13 19:58:43,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:58:43,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 19:58:43,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:58:43,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 19:58:43,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:58:43,349 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:58:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:58:43,471 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-12-13 19:58:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 19:58:43,472 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-12-13 19:58:43,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:58:43,472 INFO L225 Difference]: With dead ends: 67 [2022-12-13 19:58:43,472 INFO L226 Difference]: Without dead ends: 67 [2022-12-13 19:58:43,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-12-13 19:58:43,473 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 82 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:58:43,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 291 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:58:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-13 19:58:43,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-12-13 19:58:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.26) internal successors, (63), 59 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:58:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2022-12-13 19:58:43,477 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 50 [2022-12-13 19:58:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:58:43,477 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2022-12-13 19:58:43,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:58:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-12-13 19:58:43,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 19:58:43,478 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:58:43,479 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:58:43,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 19:58:43,479 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:58:43,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:43,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1290611022, now seen corresponding path program 1 times [2022-12-13 19:58:43,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:58:43,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533008191] [2022-12-13 19:58:43,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:43,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:58:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:43,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:58:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:43,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 19:58:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:43,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 19:58:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 19:58:43,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:58:43,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533008191] [2022-12-13 19:58:43,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533008191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:58:43,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:58:43,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 19:58:43,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444708227] [2022-12-13 19:58:43,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:58:43,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 19:58:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:58:43,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 19:58:43,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-12-13 19:58:43,963 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:58:44,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:58:44,262 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-12-13 19:58:44,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 19:58:44,262 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-12-13 19:58:44,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:58:44,263 INFO L225 Difference]: With dead ends: 65 [2022-12-13 19:58:44,263 INFO L226 Difference]: Without dead ends: 65 [2022-12-13 19:58:44,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-12-13 19:58:44,264 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 155 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:58:44,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 277 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 19:58:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-13 19:58:44,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-12-13 19:58:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:58:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-12-13 19:58:44,267 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 53 [2022-12-13 19:58:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:58:44,268 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-12-13 19:58:44,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:58:44,268 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-12-13 19:58:44,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 19:58:44,269 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:58:44,269 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:58:44,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 19:58:44,269 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:58:44,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:44,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1354235562, now seen corresponding path program 1 times [2022-12-13 19:58:44,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:58:44,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365536142] [2022-12-13 19:58:44,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:44,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:58:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:45,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:58:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:45,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 19:58:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:45,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 19:58:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 19:58:45,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:58:45,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365536142] [2022-12-13 19:58:45,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365536142] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:58:45,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229938816] [2022-12-13 19:58:45,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:45,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:58:45,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:58:45,333 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:58:45,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 19:58:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:45,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 118 conjunts are in the unsatisfiable core [2022-12-13 19:58:45,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:58:45,787 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-12-13 19:58:45,791 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-12-13 19:58:46,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:46,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:46,128 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 22 treesize of output 25 [2022-12-13 19:58:46,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:46,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:46,143 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 24 treesize of output 27 [2022-12-13 19:58:46,159 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 19:58:46,160 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-12-13 19:58:46,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:46,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:58:46,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2022-12-13 19:58:46,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:46,436 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:58:46,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-12-13 19:58:46,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:46,553 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-12-13 19:58:46,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:46,561 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-12-13 19:58:46,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:58:46,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:46,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:58:46,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 40 [2022-12-13 19:58:46,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:46,813 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 19:58:46,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-12-13 19:58:46,983 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 19:58:46,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:58:50,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229938816] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:58:50,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:58:50,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 50 [2022-12-13 19:58:50,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655594600] [2022-12-13 19:58:50,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:58:50,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-13 19:58:50,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:58:50,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-13 19:58:50,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3687, Unknown=0, NotChecked=0, Total=3906 [2022-12-13 19:58:50,651 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 51 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 45 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 19:58:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:58:53,171 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-12-13 19:58:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 19:58:53,171 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 45 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2022-12-13 19:58:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:58:53,172 INFO L225 Difference]: With dead ends: 105 [2022-12-13 19:58:53,172 INFO L226 Difference]: Without dead ends: 105 [2022-12-13 19:58:53,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1672 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=659, Invalid=6651, Unknown=0, NotChecked=0, Total=7310 [2022-12-13 19:58:53,174 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 579 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 19:58:53,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 616 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 19:58:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-13 19:58:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2022-12-13 19:58:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 62 states have internal predecessors, (68), 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-12-13 19:58:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-12-13 19:58:53,178 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 54 [2022-12-13 19:58:53,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:58:53,178 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-12-13 19:58:53,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 45 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 19:58:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-12-13 19:58:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 19:58:53,179 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:58:53,179 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:58:53,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 19:58:53,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 19:58:53,380 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:58:53,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:58:53,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1354235561, now seen corresponding path program 1 times [2022-12-13 19:58:53,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:58:53,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783328080] [2022-12-13 19:58:53,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:53,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:58:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:54,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:58:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:54,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 19:58:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:54,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 19:58:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 19:58:54,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:58:54,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783328080] [2022-12-13 19:58:54,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783328080] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:58:54,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803833364] [2022-12-13 19:58:54,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:58:54,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:58:54,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:58:54,727 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:58:54,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 19:58:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:58:54,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-13 19:58:54,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:58:55,250 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-12-13 19:58:55,254 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-12-13 19:58:55,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:55,569 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-12-13 19:58:55,581 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 19:58:55,581 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-12-13 19:58:55,586 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-12-13 19:58:55,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:55,594 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 14 treesize of output 16 [2022-12-13 19:58:55,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:55,796 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 25 treesize of output 20 [2022-12-13 19:58:55,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:55,809 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 35 treesize of output 26 [2022-12-13 19:58:55,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:55,906 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-12-13 19:58:55,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:55,910 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-12-13 19:58:56,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:58:56,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:56,176 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:58:56,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 40 [2022-12-13 19:58:56,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:58:56,186 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 19:58:56,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-12-13 19:58:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 19:58:56,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:58:57,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803833364] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:58:57,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:58:57,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2022-12-13 19:58:57,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337738760] [2022-12-13 19:58:57,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:58:57,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-13 19:58:57,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:58:57,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-13 19:58:57,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3468, Unknown=1, NotChecked=0, Total=3660 [2022-12-13 19:58:57,846 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 49 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 19:59:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:59:01,526 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-12-13 19:59:01,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 19:59:01,527 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2022-12-13 19:59:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:59:01,527 INFO L225 Difference]: With dead ends: 91 [2022-12-13 19:59:01,527 INFO L226 Difference]: Without dead ends: 91 [2022-12-13 19:59:01,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=572, Invalid=6735, Unknown=3, NotChecked=0, Total=7310 [2022-12-13 19:59:01,528 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 663 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:59:01,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 732 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1351 Invalid, 2 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 19:59:01,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-12-13 19:59:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2022-12-13 19:59:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 64 states have internal predecessors, (69), 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-12-13 19:59:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-12-13 19:59:01,530 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 54 [2022-12-13 19:59:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:59:01,531 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-12-13 19:59:01,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 19:59:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-12-13 19:59:01,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 19:59:01,531 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:59:01,531 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:59:01,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 19:59:01,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 19:59:01,733 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:59:01,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:59:01,734 INFO L85 PathProgramCache]: Analyzing trace with hash 968369212, now seen corresponding path program 1 times [2022-12-13 19:59:01,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:59:01,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983017997] [2022-12-13 19:59:01,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:59:01,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:59:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:02,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:59:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:02,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 19:59:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:02,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 19:59:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 19:59:02,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:59:02,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983017997] [2022-12-13 19:59:02,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983017997] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:59:02,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053459213] [2022-12-13 19:59:02,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:59:02,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:59:02,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:59:02,510 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:59:02,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 19:59:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:02,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-13 19:59:02,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:59:02,833 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 8 treesize of output 4 [2022-12-13 19:59:02,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:02,988 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 17 treesize of output 12 [2022-12-13 19:59:03,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:03,102 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 26 treesize of output 21 [2022-12-13 19:59:03,158 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-12-13 19:59:03,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:03,162 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2022-12-13 19:59:03,200 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-12-13 19:59:03,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:59:03,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:03,290 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:59:03,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 19 [2022-12-13 19:59:03,353 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 19:59:03,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:59:03,434 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 114 treesize of output 106 [2022-12-13 19:59:03,969 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (not .cse0) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| Int) (v_ArrVal_1695 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| |c_#StackHeapBarrier|)) (not (= (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (store v_ArrVal_1695 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_1695) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 4) 0)))) (not .cse3)) (or (and .cse0 .cse3) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| Int) (v_ArrVal_1695 (Array Int Int)) (v_arrayElimCell_55 Int)) (or (not (= (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (store v_ArrVal_1695 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_1695) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_55)) 0)) (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| |c_#StackHeapBarrier|)) (<= (+ v_arrayElimCell_55 1) 0)))))) is different from false [2022-12-13 19:59:03,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053459213] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:59:03,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:59:03,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 42 [2022-12-13 19:59:03,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631603103] [2022-12-13 19:59:03,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:59:03,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-13 19:59:03,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:59:03,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-13 19:59:03,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2104, Unknown=1, NotChecked=92, Total=2352 [2022-12-13 19:59:03,974 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 42 states, 40 states have (on average 1.95) internal successors, (78), 36 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 19:59:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:59:04,979 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-12-13 19:59:04,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 19:59:04,979 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.95) internal successors, (78), 36 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2022-12-13 19:59:04,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:59:04,980 INFO L225 Difference]: With dead ends: 72 [2022-12-13 19:59:04,980 INFO L226 Difference]: Without dead ends: 72 [2022-12-13 19:59:04,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=508, Invalid=4051, Unknown=1, NotChecked=132, Total=4692 [2022-12-13 19:59:04,981 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 453 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 19:59:04,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 639 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 19:59:04,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-12-13 19:59:04,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-12-13 19:59:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 64 states have internal predecessors, (68), 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-12-13 19:59:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-12-13 19:59:04,983 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 55 [2022-12-13 19:59:04,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:59:04,983 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-12-13 19:59:04,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.95) internal successors, (78), 36 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 19:59:04,984 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-12-13 19:59:04,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 19:59:04,984 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:59:04,985 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:59:04,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 19:59:05,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 19:59:05,187 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:59:05,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:59:05,188 INFO L85 PathProgramCache]: Analyzing trace with hash -567858883, now seen corresponding path program 1 times [2022-12-13 19:59:05,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:59:05,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933072508] [2022-12-13 19:59:05,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:59:05,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:59:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:06,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:59:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:06,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 19:59:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:06,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 19:59:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 19:59:07,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:59:07,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933072508] [2022-12-13 19:59:07,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933072508] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:59:07,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571763350] [2022-12-13 19:59:07,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:59:07,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:59:07,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:59:07,148 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:59:07,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 19:59:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:07,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 135 conjunts are in the unsatisfiable core [2022-12-13 19:59:07,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:59:07,367 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-12-13 19:59:07,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:07,555 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 21 treesize of output 20 [2022-12-13 19:59:07,830 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 30 treesize of output 18 [2022-12-13 19:59:07,834 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-12-13 19:59:07,837 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-12-13 19:59:07,839 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-12-13 19:59:08,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:08,126 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 11 [2022-12-13 19:59:08,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:08,134 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 38 treesize of output 29 [2022-12-13 19:59:08,148 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-12-13 19:59:08,148 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 1 case distinctions, treesize of input 20 treesize of output 23 [2022-12-13 19:59:08,152 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-12-13 19:59:08,165 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 19:59:08,165 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-12-13 19:59:08,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:08,453 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 46 treesize of output 33 [2022-12-13 19:59:08,460 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 18 treesize of output 20 [2022-12-13 19:59:08,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:08,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-12-13 19:59:08,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:08,606 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2022-12-13 19:59:08,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:08,614 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 22 treesize of output 24 [2022-12-13 19:59:08,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:08,625 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-12-13 19:59:08,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:59:08,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:08,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:59:08,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 47 [2022-12-13 19:59:08,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:08,991 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 19:59:08,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-12-13 19:59:09,206 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-12-13 19:59:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 19:59:09,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:59:11,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571763350] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:59:11,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:59:11,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 51 [2022-12-13 19:59:11,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71240858] [2022-12-13 19:59:11,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:59:11,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-13 19:59:11,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:59:11,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-13 19:59:11,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=3601, Unknown=0, NotChecked=0, Total=3782 [2022-12-13 19:59:11,260 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 51 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 45 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 19:59:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:59:14,138 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-12-13 19:59:14,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 19:59:14,139 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 45 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2022-12-13 19:59:14,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:59:14,139 INFO L225 Difference]: With dead ends: 70 [2022-12-13 19:59:14,139 INFO L226 Difference]: Without dead ends: 70 [2022-12-13 19:59:14,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=458, Invalid=6682, Unknown=0, NotChecked=0, Total=7140 [2022-12-13 19:59:14,141 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 292 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:59:14,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 801 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 19:59:14,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-13 19:59:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-12-13 19:59:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 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-12-13 19:59:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-12-13 19:59:14,143 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 58 [2022-12-13 19:59:14,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:59:14,143 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-12-13 19:59:14,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 45 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 19:59:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-12-13 19:59:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 19:59:14,144 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:59:14,144 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:59:14,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 19:59:14,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 19:59:14,346 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:59:14,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:59:14,347 INFO L85 PathProgramCache]: Analyzing trace with hash -423755733, now seen corresponding path program 2 times [2022-12-13 19:59:14,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:59:14,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143393094] [2022-12-13 19:59:14,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:59:14,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:59:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:15,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:59:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:15,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 19:59:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:15,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 19:59:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:16,404 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 19:59:16,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:59:16,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143393094] [2022-12-13 19:59:16,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143393094] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:59:16,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550697236] [2022-12-13 19:59:16,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:59:16,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:59:16,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:59:16,405 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:59:16,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 19:59:16,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:59:16,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:59:16,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 134 conjunts are in the unsatisfiable core [2022-12-13 19:59:16,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:59:16,868 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-12-13 19:59:16,868 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 19 treesize of output 16 [2022-12-13 19:59:16,987 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-12-13 19:59:17,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:59:17,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2022-12-13 19:59:17,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 19:59:17,361 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-12-13 19:59:17,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:17,784 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-12-13 19:59:17,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:17,797 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 19:59:17,797 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 50 [2022-12-13 19:59:17,828 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-12-13 19:59:17,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2022-12-13 19:59:18,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:18,245 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 25 treesize of output 20 [2022-12-13 19:59:18,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:18,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:59:18,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:18,263 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 19:59:18,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 54 [2022-12-13 19:59:18,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:18,457 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 19:59:18,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 51 [2022-12-13 19:59:18,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:18,471 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-12-13 19:59:18,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:18,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:59:18,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 21 [2022-12-13 19:59:19,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:59:19,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:59:19,492 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-12-13 19:59:19,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 125 treesize of output 56 [2022-12-13 19:59:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:59:19,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:59:22,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550697236] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:59:22,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:59:22,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 32] total 66 [2022-12-13 19:59:22,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870680401] [2022-12-13 19:59:22,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:59:22,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-12-13 19:59:22,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:59:22,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-12-13 19:59:22,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=6207, Unknown=2, NotChecked=0, Total=6480 [2022-12-13 19:59:22,572 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 67 states, 64 states have (on average 1.625) internal successors, (104), 59 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 19:59:31,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:59:31,320 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-12-13 19:59:31,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 19:59:31,321 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 64 states have (on average 1.625) internal successors, (104), 59 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2022-12-13 19:59:31,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:59:31,321 INFO L225 Difference]: With dead ends: 109 [2022-12-13 19:59:31,321 INFO L226 Difference]: Without dead ends: 109 [2022-12-13 19:59:31,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2396 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=1064, Invalid=11144, Unknown=2, NotChecked=0, Total=12210 [2022-12-13 19:59:31,323 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 831 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 44 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-13 19:59:31,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 747 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1913 Invalid, 2 Unknown, 0 Unchecked, 1.9s Time] [2022-12-13 19:59:31,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-13 19:59:31,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 72. [2022-12-13 19:59:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 67 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-12-13 19:59:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-12-13 19:59:31,325 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 59 [2022-12-13 19:59:31,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:59:31,325 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-12-13 19:59:31,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 64 states have (on average 1.625) internal successors, (104), 59 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 19:59:31,326 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-12-13 19:59:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 19:59:31,326 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:59:31,326 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:59:31,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 19:59:31,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:59:31,527 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 19:59:31,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:59:31,529 INFO L85 PathProgramCache]: Analyzing trace with hash -423755732, now seen corresponding path program 2 times [2022-12-13 19:59:31,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:59:31,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630503773] [2022-12-13 19:59:31,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:59:31,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:59:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:33,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 19:59:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:33,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 19:59:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:33,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 19:59:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 19:59:33,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:59:33,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630503773] [2022-12-13 19:59:33,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630503773] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:59:33,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874521828] [2022-12-13 19:59:33,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:59:33,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:59:33,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:59:33,920 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:59:33,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 19:59:34,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:59:34,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:59:34,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 147 conjunts are in the unsatisfiable core [2022-12-13 19:59:34,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:59:34,089 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-12-13 19:59:34,150 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-12-13 19:59:34,191 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2288 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_2288))) is different from true [2022-12-13 19:59:34,196 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2288 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_2288))) is different from true [2022-12-13 19:59:34,208 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 19:59:34,208 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-12-13 19:59:34,483 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-12-13 19:59:34,486 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 19:59:34,487 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 7 [2022-12-13 19:59:34,733 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-13 19:59:34,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-12-13 19:59:34,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 19:59:34,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:59:34,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:59:35,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:59:35,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 42 [2022-12-13 19:59:35,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 19:59:35,476 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 19:59:35,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-12-13 19:59:35,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:36,001 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 19:59:36,001 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 75 [2022-12-13 19:59:36,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:36,019 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 19:59:36,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 57 [2022-12-13 19:59:36,035 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-12-13 19:59:36,035 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 1 case distinctions, treesize of input 24 treesize of output 38 [2022-12-13 19:59:36,043 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 15 treesize of output 11 [2022-12-13 19:59:36,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:36,098 INFO L321 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-12-13 19:59:36,098 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 33 treesize of output 33 [2022-12-13 19:59:36,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:36,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:36,553 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 19:59:36,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 61 [2022-12-13 19:59:36,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:36,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2022-12-13 19:59:36,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:36,704 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 19:59:36,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 60 [2022-12-13 19:59:36,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:36,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:36,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 68 [2022-12-13 19:59:36,727 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 19 treesize of output 15 [2022-12-13 19:59:37,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:37,942 INFO L321 Elim1Store]: treesize reduction 63, result has 20.3 percent of original size [2022-12-13 19:59:37,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 196 treesize of output 102 [2022-12-13 19:59:37,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:59:37,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:59:37,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-13 19:59:38,684 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 12 refuted. 6 times theorem prover too weak. 0 trivial. 12 not checked. [2022-12-13 19:59:38,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:59:47,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874521828] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:59:47,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:59:47,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 72 [2022-12-13 19:59:47,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827821733] [2022-12-13 19:59:47,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:59:47,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-12-13 19:59:47,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:59:47,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-12-13 19:59:47,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=7188, Unknown=22, NotChecked=342, Total=7832 [2022-12-13 19:59:47,684 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 73 states, 70 states have (on average 1.5) internal successors, (105), 63 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 20:00:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:00:00,647 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2022-12-13 20:00:00,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 20:00:00,648 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 70 states have (on average 1.5) internal successors, (105), 63 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2022-12-13 20:00:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:00:00,649 INFO L225 Difference]: With dead ends: 124 [2022-12-13 20:00:00,649 INFO L226 Difference]: Without dead ends: 124 [2022-12-13 20:00:00,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2813 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=1004, Invalid=13502, Unknown=22, NotChecked=478, Total=15006 [2022-12-13 20:00:00,651 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1002 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 2974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-12-13 20:00:00,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 1074 Invalid, 2974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2714 Invalid, 0 Unknown, 208 Unchecked, 2.9s Time] [2022-12-13 20:00:00,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-12-13 20:00:00,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 74. [2022-12-13 20:00:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 69 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-12-13 20:00:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2022-12-13 20:00:00,653 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 59 [2022-12-13 20:00:00,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:00:00,653 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2022-12-13 20:00:00,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 70 states have (on average 1.5) internal successors, (105), 63 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 20:00:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-12-13 20:00:00,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-13 20:00:00,654 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:00:00,654 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:00:00,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 20:00:00,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:00:00,856 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 20:00:00,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:00:00,857 INFO L85 PathProgramCache]: Analyzing trace with hash -251527161, now seen corresponding path program 2 times [2022-12-13 20:00:00,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:00:00,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919523979] [2022-12-13 20:00:00,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:00:00,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:00:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:00:02,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:00:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:00:02,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 20:00:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:00:02,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 20:00:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:00:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:00:02,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:00:02,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919523979] [2022-12-13 20:00:02,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919523979] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:00:02,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399200662] [2022-12-13 20:00:02,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:00:02,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:00:02,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:00:02,913 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:00:02,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 20:00:03,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:00:03,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:00:03,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 141 conjunts are in the unsatisfiable core [2022-12-13 20:00:03,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:00:03,091 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-12-13 20:00:03,134 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-12-13 20:00:03,164 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_2497 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_2497)))) is different from true [2022-12-13 20:00:03,172 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_#res#1.base| 0)) (exists ((v_ArrVal_2497 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_2497)))) is different from true [2022-12-13 20:00:03,183 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:00:03,183 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-13 20:00:03,382 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 20:00:03,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:00:03,474 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 20:00:03,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 20:00:03,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 20:00:03,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:00:03,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 21 [2022-12-13 20:00:03,882 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-12-13 20:00:04,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:04,157 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 20:00:04,157 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 43 [2022-12-13 20:00:04,168 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 20:00:04,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 20:00:04,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:04,176 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 16 treesize of output 11 [2022-12-13 20:00:04,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:04,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:00:04,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:04,467 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 20:00:04,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 43 [2022-12-13 20:00:04,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:04,480 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 25 treesize of output 20 [2022-12-13 20:00:04,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:04,595 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 20:00:04,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 40 [2022-12-13 20:00:04,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:04,607 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-12-13 20:00:04,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:04,928 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 20:00:04,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2022-12-13 20:00:05,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:00:05,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:05,304 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-12-13 20:00:05,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 34 [2022-12-13 20:00:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-12-13 20:00:05,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:00:06,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399200662] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:00:06,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:00:06,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 67 [2022-12-13 20:00:06,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181727945] [2022-12-13 20:00:06,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:00:06,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-12-13 20:00:06,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:00:06,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-12-13 20:00:06,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=5457, Unknown=2, NotChecked=298, Total=6006 [2022-12-13 20:00:06,821 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 67 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 58 states have internal predecessors, (100), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 20:00:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:00:12,395 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-12-13 20:00:12,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 20:00:12,395 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 58 states have internal predecessors, (100), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 60 [2022-12-13 20:00:12,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:00:12,395 INFO L225 Difference]: With dead ends: 93 [2022-12-13 20:00:12,395 INFO L226 Difference]: Without dead ends: 93 [2022-12-13 20:00:12,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 109 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2827 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=913, Invalid=10865, Unknown=2, NotChecked=430, Total=12210 [2022-12-13 20:00:12,397 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 454 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:00:12,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1031 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1941 Invalid, 0 Unknown, 181 Unchecked, 1.2s Time] [2022-12-13 20:00:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-12-13 20:00:12,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 74. [2022-12-13 20:00:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 69 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-12-13 20:00:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-12-13 20:00:12,399 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 60 [2022-12-13 20:00:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:00:12,399 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-12-13 20:00:12,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 58 states have internal predecessors, (100), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 20:00:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-12-13 20:00:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 20:00:12,400 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:00:12,400 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:00:12,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 20:00:12,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:00:12,602 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 20:00:12,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:00:12,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1512551826, now seen corresponding path program 2 times [2022-12-13 20:00:12,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:00:12,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730611374] [2022-12-13 20:00:12,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:00:12,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:00:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:00:14,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:00:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:00:14,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 20:00:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:00:14,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 20:00:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:00:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:00:15,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:00:15,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730611374] [2022-12-13 20:00:15,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730611374] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:00:15,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999994180] [2022-12-13 20:00:15,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:00:15,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:00:15,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:00:15,719 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:00:15,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 20:00:15,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:00:15,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:00:15,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 190 conjunts are in the unsatisfiable core [2022-12-13 20:00:15,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:00:15,900 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-12-13 20:00:15,973 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-12-13 20:00:16,109 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-12-13 20:00:16,285 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 20:00:16,285 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-12-13 20:00:16,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:16,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 21 treesize of output 20 [2022-12-13 20:00:16,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:00:17,003 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:00:17,003 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 20:00:17,007 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-12-13 20:00:17,024 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-13 20:00:17,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 20:00:17,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 20:00:17,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-13 20:00:17,226 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-12-13 20:00:17,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:00:17,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 35 [2022-12-13 20:00:17,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-12-13 20:00:17,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 20:00:17,845 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-12-13 20:00:18,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:18,285 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 20:00:18,285 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 66 [2022-12-13 20:00:18,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:18,299 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 20:00:18,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2022-12-13 20:00:18,318 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 20:00:18,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 20:00:18,333 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-12-13 20:00:18,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2022-12-13 20:00:18,337 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-12-13 20:00:18,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:18,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:00:18,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:18,899 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 20:00:18,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 61 [2022-12-13 20:00:18,921 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-12-13 20:00:18,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 48 [2022-12-13 20:00:18,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:18,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:18,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 20:00:19,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:19,148 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 20:00:19,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 58 [2022-12-13 20:00:19,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:19,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:19,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2022-12-13 20:00:19,165 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 46 treesize of output 48 [2022-12-13 20:00:21,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:00:21,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:21,404 INFO L321 Elim1Store]: treesize reduction 58, result has 21.6 percent of original size [2022-12-13 20:00:21,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 194 treesize of output 104 [2022-12-13 20:00:21,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:21,421 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-12-13 20:00:21,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 39 [2022-12-13 20:00:22,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:00:22,074 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 13 treesize of output 17 [2022-12-13 20:00:22,229 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-12-13 20:00:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:00:22,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:00:26,310 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 706 treesize of output 562 [2022-12-13 20:00:31,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999994180] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:00:31,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:00:31,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 42] total 79 [2022-12-13 20:00:31,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923998361] [2022-12-13 20:00:31,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:00:31,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-12-13 20:00:31,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:00:31,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-12-13 20:00:31,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=8834, Unknown=11, NotChecked=0, Total=9120 [2022-12-13 20:00:31,770 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 79 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 69 states have internal predecessors, (112), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 20:00:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:00:45,733 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2022-12-13 20:00:45,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 20:00:45,734 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 69 states have internal predecessors, (112), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2022-12-13 20:00:45,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:00:45,734 INFO L225 Difference]: With dead ends: 91 [2022-12-13 20:00:45,734 INFO L226 Difference]: Without dead ends: 91 [2022-12-13 20:00:45,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2394 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=960, Invalid=16057, Unknown=13, NotChecked=0, Total=17030 [2022-12-13 20:00:45,735 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 569 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 3295 mSolverCounterSat, 49 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 3346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3295 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-13 20:00:45,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1154 Invalid, 3346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3295 Invalid, 2 Unknown, 0 Unchecked, 3.5s Time] [2022-12-13 20:00:45,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-12-13 20:00:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 75. [2022-12-13 20:00:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 70 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-12-13 20:00:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-12-13 20:00:45,737 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 63 [2022-12-13 20:00:45,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:00:45,737 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-12-13 20:00:45,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 69 states have internal predecessors, (112), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 20:00:45,738 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-12-13 20:00:45,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-13 20:00:45,738 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:00:45,738 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:00:45,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 20:00:45,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 20:00:45,940 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 20:00:45,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:00:45,941 INFO L85 PathProgramCache]: Analyzing trace with hash -355533194, now seen corresponding path program 3 times [2022-12-13 20:00:45,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:00:45,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377611937] [2022-12-13 20:00:45,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:00:45,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:00:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:00:48,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:00:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:00:48,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 20:00:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:00:48,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 20:00:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:00:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 20:00:49,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:00:49,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377611937] [2022-12-13 20:00:49,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377611937] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:00:49,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316417752] [2022-12-13 20:00:49,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:00:49,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:00:49,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:00:49,078 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:00:49,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 20:00:49,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 20:00:49,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:00:49,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 190 conjunts are in the unsatisfiable core [2022-12-13 20:00:49,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:00:49,778 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-12-13 20:00:49,831 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-12-13 20:00:49,969 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:00:49,969 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-12-13 20:00:50,089 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-12-13 20:00:50,094 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-12-13 20:00:50,508 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:00:50,508 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 20:00:50,527 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-12-13 20:00:50,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2022-12-13 20:00:50,534 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 14 treesize of output 16 [2022-12-13 20:00:50,705 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 21 treesize of output 20 [2022-12-13 20:00:50,710 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 26 [2022-12-13 20:00:51,124 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-12-13 20:00:51,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 47 [2022-12-13 20:00:51,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:51,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-13 20:00:51,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:00:51,437 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 20:00:51,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-12-13 20:00:51,683 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse0 (<= (+ 2 .cse2) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse2))) (.cse3 (not (= .cse6 .cse2))) (.cse4 (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) (.cse5 (= (select (select |c_#memory_$Pointer$.base| .cse6) 4) 0)) (.cse7 (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or (and .cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) .cse3 .cse4 .cse5 (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) .cse7) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse9 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_#memory_$Pointer$.base|)) (.cse10 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse9) 4))) (and (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse8 (select |c_#memory_$Pointer$.base| .cse8))) (not (= .cse9 .cse10)) (<= (+ .cse9 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse9) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse10) 4) 0) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse10) 4) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse8) (not (= .cse10 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse9 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))))) (= .cse11 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse11 (select |c_#memory_$Pointer$.offset| .cse11))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and .cse0 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse12 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse2) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse6) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse12 (select |c_#memory_$Pointer$.offset| .cse12))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) .cse1 .cse3 .cse4 .cse5 .cse7)))))) is different from false [2022-12-13 20:00:51,693 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse0 (<= (+ 2 .cse2) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse2))) (.cse3 (not (= .cse6 .cse2))) (.cse4 (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) (.cse5 (= (select (select |c_#memory_$Pointer$.base| .cse6) 4) 0)) (.cse7 (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or (and .cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) .cse3 .cse4 .cse5 (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) .cse7) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse9 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_#memory_$Pointer$.base|)) (.cse10 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse9) 4))) (and (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse8 (select |c_#memory_$Pointer$.base| .cse8))) (not (= .cse9 .cse10)) (<= (+ .cse9 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse9) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse10) 4) 0) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse10) 4) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse8) (not (= .cse10 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse9 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))))) (= .cse11 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse11 (select |c_#memory_$Pointer$.offset| .cse11))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and .cse0 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse12 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse2) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse6) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse12 (select |c_#memory_$Pointer$.offset| .cse12))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) .cse1 .cse3 .cse4 .cse5 .cse7)))))) is different from true [2022-12-13 20:00:52,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:52,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:52,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2022-12-13 20:00:52,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:52,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:00:52,091 INFO L321 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2022-12-13 20:00:52,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 116 treesize of output 75 [2022-12-13 20:00:52,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:52,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:52,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:52,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 53 [2022-12-13 20:00:52,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:52,322 INFO L321 Elim1Store]: treesize reduction 96, result has 13.5 percent of original size [2022-12-13 20:00:52,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 113 treesize of output 72 [2022-12-13 20:00:55,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:00:55,174 INFO L321 Elim1Store]: treesize reduction 218, result has 6.0 percent of original size [2022-12-13 20:00:55,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 21 case distinctions, treesize of input 246 treesize of output 113 [2022-12-13 20:00:55,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:55,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:55,196 INFO L321 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2022-12-13 20:00:55,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 36 [2022-12-13 20:00:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:00:55,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:01:13,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316417752] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:01:13,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:01:13,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 74 [2022-12-13 20:01:13,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663018547] [2022-12-13 20:01:13,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:01:13,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-12-13 20:01:13,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:13,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-12-13 20:01:13,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=7377, Unknown=4, NotChecked=172, Total=7832 [2022-12-13 20:01:13,191 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 74 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 65 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 20:01:15,758 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse13 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse13)) (.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (.cse7 (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0)) (.cse12 (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)) (.cse8 (not (= .cse4 .cse3))) (.cse11 (= (select (select |c_#memory_$Pointer$.base| .cse4) 4) 0)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10)) (.cse17 (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (<= (+ 1 .cse3) |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| .cse2) 4) 0) (= (select |c_#valid| .cse4) 1) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse5)) (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) .cse7 (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) .cse8 (not (= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse11 (= (select (select |c_#memory_$Pointer$.base| .cse9) 4) 0) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) 4) 0) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$.base| .cse5) 4) 0) (= (select |c_#valid| .cse3) 1) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse5) 1) (= (select (select |c_#memory_$Pointer$.base| .cse0) 4) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse12 (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse6)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse13) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|) (let ((.cse14 (<= (+ 2 .cse3) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse3))) (.cse16 (not (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))) (or (and .cse14 .cse1 .cse15 .cse7 .cse8 .cse16 .cse11 .cse12 .cse17) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse21 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse19 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_#memory_$Pointer$.base|)) (.cse20 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse19) 4))) (and (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse18 (select |c_#memory_$Pointer$.base| .cse18))) (not (= .cse19 .cse20)) (<= (+ .cse19 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse19) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse20) 4) 0) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse20) 4) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse18) (not (= .cse20 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse19 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))))) (= .cse21 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse21 (select |c_#memory_$Pointer$.offset| .cse21))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and .cse14 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse22 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse22 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse3) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse4) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse22 (select |c_#memory_$Pointer$.offset| .cse22))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) .cse15 .cse8 .cse16 .cse11 .cse17))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse9) 4) 0) (<= (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_sll_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| .cse9) 1) .cse17 (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))))) is different from false [2022-12-13 20:01:15,765 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse13 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse13)) (.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (.cse7 (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0)) (.cse12 (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)) (.cse8 (not (= .cse4 .cse3))) (.cse11 (= (select (select |c_#memory_$Pointer$.base| .cse4) 4) 0)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10)) (.cse17 (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (<= (+ 1 .cse3) |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| .cse2) 4) 0) (= (select |c_#valid| .cse4) 1) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse5)) (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) .cse7 (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) .cse8 (not (= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse11 (= (select (select |c_#memory_$Pointer$.base| .cse9) 4) 0) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) 4) 0) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$.base| .cse5) 4) 0) (= (select |c_#valid| .cse3) 1) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse5) 1) (= (select (select |c_#memory_$Pointer$.base| .cse0) 4) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse12 (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse6)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse13) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|) (let ((.cse14 (<= (+ 2 .cse3) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse3))) (.cse16 (not (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))) (or (and .cse14 .cse1 .cse15 .cse7 .cse8 .cse16 .cse11 .cse12 .cse17) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse21 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse19 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_#memory_$Pointer$.base|)) (.cse20 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse19) 4))) (and (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse18 (select |c_#memory_$Pointer$.base| .cse18))) (not (= .cse19 .cse20)) (<= (+ .cse19 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse19) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse20) 4) 0) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse20) 4) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse18) (not (= .cse20 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse19 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))))) (= .cse21 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse21 (select |c_#memory_$Pointer$.offset| .cse21))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and .cse14 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse22 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse22 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse3) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse4) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse22 (select |c_#memory_$Pointer$.offset| .cse22))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) .cse15 .cse8 .cse16 .cse11 .cse17))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse9) 4) 0) (<= (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_sll_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| .cse9) 1) .cse17 (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))))) is different from true [2022-12-13 20:01:22,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:01:22,912 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2022-12-13 20:01:22,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 20:01:22,913 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 65 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 64 [2022-12-13 20:01:22,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:01:22,913 INFO L225 Difference]: With dead ends: 132 [2022-12-13 20:01:22,913 INFO L226 Difference]: Without dead ends: 132 [2022-12-13 20:01:22,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 115 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3385 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=587, Invalid=12525, Unknown=6, NotChecked=454, Total=13572 [2022-12-13 20:01:22,915 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 226 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-13 20:01:22,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1541 Invalid, 2710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2567 Invalid, 1 Unknown, 117 Unchecked, 3.5s Time] [2022-12-13 20:01:22,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-12-13 20:01:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 108. [2022-12-13 20:01:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.1521739130434783) internal successors, (106), 101 states have internal predecessors, (106), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 20:01:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2022-12-13 20:01:22,922 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 64 [2022-12-13 20:01:22,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:01:22,922 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2022-12-13 20:01:22,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 65 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 20:01:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2022-12-13 20:01:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 20:01:22,923 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:01:22,923 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:22,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 20:01:23,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 20:01:23,125 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 20:01:23,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:23,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1863371548, now seen corresponding path program 3 times [2022-12-13 20:01:23,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:23,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772809644] [2022-12-13 20:01:23,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:23,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:23,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:01:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:23,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 20:01:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:23,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 20:01:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 20:01:23,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:23,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772809644] [2022-12-13 20:01:23,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772809644] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:01:23,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432562651] [2022-12-13 20:01:23,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:01:23,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:01:23,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:01:23,350 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:01:23,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 20:01:24,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 20:01:24,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:01:24,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 20:01:24,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:01:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 20:01:24,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:01:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 20:01:24,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432562651] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:01:24,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:01:24,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-12-13 20:01:24,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878410755] [2022-12-13 20:01:24,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:01:24,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 20:01:24,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:24,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 20:01:24,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 20:01:24,384 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 20:01:24,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:01:24,465 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-12-13 20:01:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:01:24,466 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-12-13 20:01:24,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:01:24,466 INFO L225 Difference]: With dead ends: 119 [2022-12-13 20:01:24,466 INFO L226 Difference]: Without dead ends: 119 [2022-12-13 20:01:24,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 20:01:24,467 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 39 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:01:24,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 454 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:01:24,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-13 20:01:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2022-12-13 20:01:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 103 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 20:01:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2022-12-13 20:01:24,470 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 65 [2022-12-13 20:01:24,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:01:24,471 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2022-12-13 20:01:24,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 20:01:24,471 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2022-12-13 20:01:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 20:01:24,472 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:01:24,472 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:24,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 20:01:24,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:01:24,673 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 20:01:24,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:24,674 INFO L85 PathProgramCache]: Analyzing trace with hash -749426673, now seen corresponding path program 1 times [2022-12-13 20:01:24,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:24,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994961980] [2022-12-13 20:01:24,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:24,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:24,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:01:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:24,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 20:01:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:24,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 20:01:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:24,907 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-13 20:01:24,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:24,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994961980] [2022-12-13 20:01:24,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994961980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:01:24,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:01:24,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 20:01:24,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508490221] [2022-12-13 20:01:24,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:01:24,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:01:24,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:24,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:01:24,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:01:24,908 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:01:25,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:01:25,051 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2022-12-13 20:01:25,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 20:01:25,052 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2022-12-13 20:01:25,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:01:25,052 INFO L225 Difference]: With dead ends: 119 [2022-12-13 20:01:25,052 INFO L226 Difference]: Without dead ends: 119 [2022-12-13 20:01:25,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-12-13 20:01:25,053 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 111 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:01:25,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 207 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:01:25,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-13 20:01:25,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2022-12-13 20:01:25,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 104 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 20:01:25,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2022-12-13 20:01:25,055 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 68 [2022-12-13 20:01:25,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:01:25,055 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2022-12-13 20:01:25,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:01:25,055 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2022-12-13 20:01:25,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 20:01:25,056 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:01:25,056 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:25,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 20:01:25,056 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 20:01:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:25,056 INFO L85 PathProgramCache]: Analyzing trace with hash -749426672, now seen corresponding path program 1 times [2022-12-13 20:01:25,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:25,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394983831] [2022-12-13 20:01:25,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:25,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:25,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:01:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:25,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 20:01:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:25,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 20:01:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 20:01:25,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:25,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394983831] [2022-12-13 20:01:25,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394983831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:01:25,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:01:25,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 20:01:25,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130603102] [2022-12-13 20:01:25,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:01:25,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:01:25,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:25,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:01:25,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:01:25,350 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:01:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:01:25,523 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-12-13 20:01:25,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 20:01:25,523 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2022-12-13 20:01:25,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:01:25,523 INFO L225 Difference]: With dead ends: 119 [2022-12-13 20:01:25,523 INFO L226 Difference]: Without dead ends: 119 [2022-12-13 20:01:25,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-13 20:01:25,524 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 133 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:01:25,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 197 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:01:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-13 20:01:25,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2022-12-13 20:01:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 98 states have (on average 1.153061224489796) internal successors, (113), 106 states have internal predecessors, (113), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 20:01:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2022-12-13 20:01:25,526 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 68 [2022-12-13 20:01:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:01:25,526 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2022-12-13 20:01:25,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:01:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2022-12-13 20:01:25,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 20:01:25,527 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:01:25,527 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:25,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 20:01:25,527 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 20:01:25,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:25,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1757391830, now seen corresponding path program 1 times [2022-12-13 20:01:25,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:25,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495676970] [2022-12-13 20:01:25,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:25,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:25,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:01:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:25,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 20:01:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:25,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 20:01:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 20:01:25,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:25,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495676970] [2022-12-13 20:01:25,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495676970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:01:25,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:01:25,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 20:01:25,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319483322] [2022-12-13 20:01:25,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:01:25,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:01:25,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:25,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:01:25,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:01:25,708 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:01:25,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:01:25,839 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-12-13 20:01:25,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:01:25,839 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 69 [2022-12-13 20:01:25,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:01:25,840 INFO L225 Difference]: With dead ends: 116 [2022-12-13 20:01:25,840 INFO L226 Difference]: Without dead ends: 116 [2022-12-13 20:01:25,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-13 20:01:25,840 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 90 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:01:25,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 268 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:01:25,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-12-13 20:01:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2022-12-13 20:01:25,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 106 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 20:01:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2022-12-13 20:01:25,842 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 69 [2022-12-13 20:01:25,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:01:25,843 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2022-12-13 20:01:25,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:01:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2022-12-13 20:01:25,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 20:01:25,843 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:01:25,843 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:25,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 20:01:25,844 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 20:01:25,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash -929953077, now seen corresponding path program 1 times [2022-12-13 20:01:25,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:25,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959954375] [2022-12-13 20:01:25,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:25,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:26,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:01:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:26,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 20:01:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:26,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 20:01:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 20:01:26,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:26,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959954375] [2022-12-13 20:01:26,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959954375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:01:26,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:01:26,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 20:01:26,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664429794] [2022-12-13 20:01:26,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:01:26,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:01:26,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:26,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:01:26,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:01:26,042 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:01:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:01:26,159 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-12-13 20:01:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:01:26,159 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2022-12-13 20:01:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:01:26,160 INFO L225 Difference]: With dead ends: 114 [2022-12-13 20:01:26,160 INFO L226 Difference]: Without dead ends: 114 [2022-12-13 20:01:26,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-13 20:01:26,161 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 114 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:01:26,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 227 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:01:26,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-13 20:01:26,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-12-13 20:01:26,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 107 states have internal predecessors, (113), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 20:01:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2022-12-13 20:01:26,163 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 71 [2022-12-13 20:01:26,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:01:26,163 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2022-12-13 20:01:26,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:01:26,164 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2022-12-13 20:01:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-13 20:01:26,164 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:01:26,164 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:26,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 20:01:26,165 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-12-13 20:01:26,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:26,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1692934892, now seen corresponding path program 1 times [2022-12-13 20:01:26,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:26,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058441972] [2022-12-13 20:01:26,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:26,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:26,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:01:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:26,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 20:01:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:26,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 20:01:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 20:01:27,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:27,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058441972] [2022-12-13 20:01:27,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058441972] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:01:27,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482962666] [2022-12-13 20:01:27,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:27,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:01:27,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:01:27,186 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:01:27,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f68331-6e4e-410a-8f96-48e26c8e1896/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 20:01:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:27,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-13 20:01:27,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:01:27,415 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-12-13 20:01:27,575 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-12-13 20:01:28,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:01:28,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 114 [2022-12-13 20:01:29,955 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 325 treesize of output 269 [2022-12-13 20:01:30,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:01:31,721 INFO L321 Elim1Store]: treesize reduction 72, result has 90.9 percent of original size [2022-12-13 20:01:31,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 22 new quantified variables, introduced 78 case distinctions, treesize of input 347 treesize of output 848