./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.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_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/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_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/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_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/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 f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- 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 14:31:49,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:31:49,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:31:49,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:31:49,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:31:49,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:31:49,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:31:49,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:31:49,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:31:49,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:31:49,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:31:49,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:31:49,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:31:49,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:31:49,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:31:49,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:31:49,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:31:49,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:31:49,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:31:49,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:31:49,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:31:49,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:31:49,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:31:49,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:31:49,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:31:49,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:31:49,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:31:49,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:31:49,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:31:49,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:31:49,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:31:49,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:31:49,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:31:49,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:31:49,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:31:49,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:31:49,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:31:49,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:31:49,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:31:49,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:31:49,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:31:49,903 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 14:31:49,918 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:31:49,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:31:49,918 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:31:49,918 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:31:49,919 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 14:31:49,919 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 14:31:49,925 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:31:49,925 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:31:49,925 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:31:49,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:31:49,926 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 14:31:49,926 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 14:31:49,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:31:49,926 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 14:31:49,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:31:49,927 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 14:31:49,927 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 14:31:49,927 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 14:31:49,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 14:31:49,927 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 14:31:49,928 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 14:31:49,928 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:31:49,928 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:31:49,928 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:31:49,928 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 14:31:49,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:31:49,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:31:49,929 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 14:31:49,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 14:31:49,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 14:31:49,929 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 14:31:49,929 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 14:31:49,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 14:31:49,929 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 14:31:49,929 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_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/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_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2022-12-13 14:31:50,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:31:50,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:31:50,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:31:50,111 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:31:50,111 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:31:50,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2022-12-13 14:31:52,721 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:31:52,907 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:31:52,908 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2022-12-13 14:31:52,916 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/data/bfd3db0ef/4988fe3ff0e34749ab2c38548fb48810/FLAG287498181 [2022-12-13 14:31:52,927 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/data/bfd3db0ef/4988fe3ff0e34749ab2c38548fb48810 [2022-12-13 14:31:52,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:31:52,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:31:52,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:31:52,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:31:52,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:31:52,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:31:52" (1/1) ... [2022-12-13 14:31:52,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@254aecd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:31:52, skipping insertion in model container [2022-12-13 14:31:52,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:31:52" (1/1) ... [2022-12-13 14:31:52,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:31:52,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:31:53,203 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_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2022-12-13 14:31:53,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:31:53,215 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:31:53,254 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_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2022-12-13 14:31:53,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:31:53,275 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:31:53,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:31:53 WrapperNode [2022-12-13 14:31:53,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:31:53,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:31:53,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:31:53,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:31:53,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:31:53" (1/1) ... [2022-12-13 14:31:53,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:31:53" (1/1) ... [2022-12-13 14:31:53,317 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2022-12-13 14:31:53,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:31:53,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:31:53,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:31:53,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:31:53,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:31:53" (1/1) ... [2022-12-13 14:31:53,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:31:53" (1/1) ... [2022-12-13 14:31:53,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:31:53" (1/1) ... [2022-12-13 14:31:53,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:31:53" (1/1) ... [2022-12-13 14:31:53,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:31:53" (1/1) ... [2022-12-13 14:31:53,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:31:53" (1/1) ... [2022-12-13 14:31:53,343 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:31:53" (1/1) ... [2022-12-13 14:31:53,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:31:53" (1/1) ... [2022-12-13 14:31:53,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:31:53,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:31:53,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:31:53,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:31:53,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:31:53" (1/1) ... [2022-12-13 14:31:53,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:31:53,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:31:53,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 14:31:53,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 14:31:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 14:31:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 14:31:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-13 14:31:53,406 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-13 14:31:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 14:31:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:31:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 14:31:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 14:31:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 14:31:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 14:31:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 14:31:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 14:31:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:31:53,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:31:53,508 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:31:53,509 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:31:53,779 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:31:53,784 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:31:53,785 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 14:31:53,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:31:53 BoogieIcfgContainer [2022-12-13 14:31:53,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:31:53,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 14:31:53,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 14:31:53,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 14:31:53,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:31:52" (1/3) ... [2022-12-13 14:31:53,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30594133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:31:53, skipping insertion in model container [2022-12-13 14:31:53,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:31:53" (2/3) ... [2022-12-13 14:31:53,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30594133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:31:53, skipping insertion in model container [2022-12-13 14:31:53,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:31:53" (3/3) ... [2022-12-13 14:31:53,792 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2022-12-13 14:31:53,806 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 14:31:53,806 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2022-12-13 14:31:53,855 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 14:31:53,859 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;@4081d3d7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 14:31:53,860 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2022-12-13 14:31:53,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 122 states have internal predecessors, (136), 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 14:31:53,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 14:31:53,867 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:31:53,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 14:31:53,868 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:31:53,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:31:53,871 INFO L85 PathProgramCache]: Analyzing trace with hash 895521621, now seen corresponding path program 1 times [2022-12-13 14:31:53,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:31:53,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010362262] [2022-12-13 14:31:53,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:31:53,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:31:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:54,060 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 14:31:54,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:31:54,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010362262] [2022-12-13 14:31:54,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010362262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:31:54,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:31:54,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:31:54,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790649456] [2022-12-13 14:31:54,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:31:54,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:31:54,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:31:54,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:31:54,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:31:54,096 INFO L87 Difference]: Start difference. First operand has 127 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 122 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:31:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:31:54,206 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2022-12-13 14:31:54,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:31:54,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-13 14:31:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:31:54,214 INFO L225 Difference]: With dead ends: 125 [2022-12-13 14:31:54,214 INFO L226 Difference]: Without dead ends: 122 [2022-12-13 14:31:54,216 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 14:31:54,218 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 8 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:31:54,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 197 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:31:54,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-12-13 14:31:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-12-13 14:31:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.953125) internal successors, (125), 117 states have internal predecessors, (125), 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 14:31:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2022-12-13 14:31:54,252 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 6 [2022-12-13 14:31:54,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:31:54,252 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2022-12-13 14:31:54,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:31:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2022-12-13 14:31:54,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 14:31:54,253 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:31:54,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 14:31:54,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 14:31:54,253 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:31:54,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:31:54,254 INFO L85 PathProgramCache]: Analyzing trace with hash 895521622, now seen corresponding path program 1 times [2022-12-13 14:31:54,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:31:54,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937410436] [2022-12-13 14:31:54,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:31:54,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:31:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:54,346 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 14:31:54,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:31:54,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937410436] [2022-12-13 14:31:54,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937410436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:31:54,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:31:54,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:31:54,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100516694] [2022-12-13 14:31:54,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:31:54,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:31:54,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:31:54,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:31:54,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:31:54,349 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:31:54,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:31:54,426 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2022-12-13 14:31:54,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:31:54,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-13 14:31:54,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:31:54,428 INFO L225 Difference]: With dead ends: 120 [2022-12-13 14:31:54,428 INFO L226 Difference]: Without dead ends: 120 [2022-12-13 14:31:54,428 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 14:31:54,429 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:31:54,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 199 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:31:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-12-13 14:31:54,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-12-13 14:31:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 64 states have (on average 1.921875) internal successors, (123), 115 states have internal predecessors, (123), 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 14:31:54,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2022-12-13 14:31:54,435 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 6 [2022-12-13 14:31:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:31:54,436 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2022-12-13 14:31:54,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:31:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2022-12-13 14:31:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 14:31:54,436 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:31:54,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:31:54,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 14:31:54,436 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:31:54,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:31:54,437 INFO L85 PathProgramCache]: Analyzing trace with hash 164994135, now seen corresponding path program 1 times [2022-12-13 14:31:54,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:31:54,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441867252] [2022-12-13 14:31:54,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:31:54,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:31:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:54,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:31:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:54,517 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 14:31:54,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:31:54,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441867252] [2022-12-13 14:31:54,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441867252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:31:54,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:31:54,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:31:54,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506756713] [2022-12-13 14:31:54,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:31:54,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:31:54,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:31:54,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:31:54,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:31:54,519 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 14:31:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:31:54,637 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-12-13 14:31:54,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:31:54,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 14:31:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:31:54,638 INFO L225 Difference]: With dead ends: 127 [2022-12-13 14:31:54,639 INFO L226 Difference]: Without dead ends: 127 [2022-12-13 14:31:54,639 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 14:31:54,640 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 5 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:31:54,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 296 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:31:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-12-13 14:31:54,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2022-12-13 14:31:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 116 states have internal predecessors, (124), 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 14:31:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2022-12-13 14:31:54,651 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 13 [2022-12-13 14:31:54,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:31:54,652 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2022-12-13 14:31:54,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 14:31:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2022-12-13 14:31:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 14:31:54,653 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:31:54,653 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:31:54,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 14:31:54,653 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:31:54,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:31:54,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1546453220, now seen corresponding path program 1 times [2022-12-13 14:31:54,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:31:54,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402184193] [2022-12-13 14:31:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:31:54,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:31:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:54,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:31:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:54,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:31:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:54,829 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 14:31:54,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:31:54,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402184193] [2022-12-13 14:31:54,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402184193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:31:54,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:31:54,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:31:54,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070849048] [2022-12-13 14:31:54,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:31:54,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:31:54,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:31:54,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:31:54,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:31:54,832 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 14:31:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:31:55,019 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2022-12-13 14:31:55,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:31:55,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 22 [2022-12-13 14:31:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:31:55,022 INFO L225 Difference]: With dead ends: 121 [2022-12-13 14:31:55,022 INFO L226 Difference]: Without dead ends: 121 [2022-12-13 14:31:55,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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 14:31:55,023 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 13 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:31:55,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 419 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:31:55,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-13 14:31:55,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2022-12-13 14:31:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 65 states have (on average 1.8923076923076922) internal successors, (123), 115 states have internal predecessors, (123), 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 14:31:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2022-12-13 14:31:55,030 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 22 [2022-12-13 14:31:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:31:55,030 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2022-12-13 14:31:55,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 14:31:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2022-12-13 14:31:55,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 14:31:55,031 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:31:55,031 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:31:55,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 14:31:55,032 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:31:55,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:31:55,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1546453219, now seen corresponding path program 1 times [2022-12-13 14:31:55,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:31:55,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319133826] [2022-12-13 14:31:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:31:55,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:31:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:55,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:31:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:31:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:31:55,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:31:55,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319133826] [2022-12-13 14:31:55,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319133826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:31:55,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:31:55,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:31:55,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134656628] [2022-12-13 14:31:55,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:31:55,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:31:55,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:31:55,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:31:55,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:31:55,245 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 14:31:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:31:55,437 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2022-12-13 14:31:55,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:31:55,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 22 [2022-12-13 14:31:55,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:31:55,439 INFO L225 Difference]: With dead ends: 120 [2022-12-13 14:31:55,439 INFO L226 Difference]: Without dead ends: 120 [2022-12-13 14:31:55,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 14:31:55,440 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 11 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:31:55,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 443 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:31:55,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-12-13 14:31:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-12-13 14:31:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 1.876923076923077) internal successors, (122), 114 states have internal predecessors, (122), 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 14:31:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2022-12-13 14:31:55,447 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 22 [2022-12-13 14:31:55,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:31:55,447 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2022-12-13 14:31:55,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 14:31:55,447 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2022-12-13 14:31:55,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 14:31:55,448 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:31:55,448 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:31:55,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 14:31:55,448 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:31:55,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:31:55,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1726296005, now seen corresponding path program 1 times [2022-12-13 14:31:55,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:31:55,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251303353] [2022-12-13 14:31:55,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:31:55,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:31:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:55,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:31:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:55,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:31:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 14:31:55,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:31:55,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251303353] [2022-12-13 14:31:55,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251303353] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:31:55,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152197519] [2022-12-13 14:31:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:31:55,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:31:55,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:31:55,648 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:31:55,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 14:31:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:55,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 14:31:55,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:31:55,776 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 14:31:55,815 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_256))) is different from true [2022-12-13 14:31:55,831 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_256))) is different from true [2022-12-13 14:31:55,849 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 14:31:55,849 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 14:31:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-12-13 14:31:55,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:31:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:31:56,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152197519] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:31:56,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:31:56,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-12-13 14:31:56,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073958887] [2022-12-13 14:31:56,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:31:56,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 14:31:56,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:31:56,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 14:31:56,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2022-12-13 14:31:56,159 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 14:31:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:31:56,416 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2022-12-13 14:31:56,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:31:56,417 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-12-13 14:31:56,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:31:56,417 INFO L225 Difference]: With dead ends: 136 [2022-12-13 14:31:56,417 INFO L226 Difference]: Without dead ends: 136 [2022-12-13 14:31:56,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2022-12-13 14:31:56,418 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 208 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:31:56,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 441 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 425 Invalid, 0 Unknown, 246 Unchecked, 0.2s Time] [2022-12-13 14:31:56,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-12-13 14:31:56,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2022-12-13 14:31:56,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 113 states have internal predecessors, (121), 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 14:31:56,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2022-12-13 14:31:56,422 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 25 [2022-12-13 14:31:56,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:31:56,422 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2022-12-13 14:31:56,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 14:31:56,422 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2022-12-13 14:31:56,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 14:31:56,423 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:31:56,423 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:31:56,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 14:31:56,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 14:31:56,624 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:31:56,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:31:56,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1726296006, now seen corresponding path program 1 times [2022-12-13 14:31:56,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:31:56,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554014527] [2022-12-13 14:31:56,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:31:56,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:31:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:56,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:31:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:56,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:31:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:31:56,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:31:56,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554014527] [2022-12-13 14:31:56,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554014527] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:31:56,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796290802] [2022-12-13 14:31:56,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:31:56,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:31:56,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:31:56,926 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:31:56,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 14:31:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:57,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 14:31:57,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:31:57,013 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 14:31:57,198 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:31:57,198 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 14:31:57,205 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 11 [2022-12-13 14:31:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:31:57,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:31:57,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796290802] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:31:57,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 14:31:57,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-12-13 14:31:57,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921993268] [2022-12-13 14:31:57,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 14:31:57,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 14:31:57,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:31:57,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 14:31:57,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-12-13 14:31:57,380 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 14:31:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:31:57,867 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2022-12-13 14:31:57,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 14:31:57,867 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-12-13 14:31:57,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:31:57,868 INFO L225 Difference]: With dead ends: 119 [2022-12-13 14:31:57,868 INFO L226 Difference]: Without dead ends: 119 [2022-12-13 14:31:57,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2022-12-13 14:31:57,869 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 117 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:31:57,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 604 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:31:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-13 14:31:57,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2022-12-13 14:31:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 65 states have (on average 1.8461538461538463) internal successors, (120), 112 states have internal predecessors, (120), 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 14:31:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2022-12-13 14:31:57,875 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 25 [2022-12-13 14:31:57,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:31:57,875 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2022-12-13 14:31:57,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 14:31:57,875 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2022-12-13 14:31:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 14:31:57,876 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:31:57,876 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:31:57,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 14:31:58,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 14:31:58,078 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:31:58,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:31:58,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1086704927, now seen corresponding path program 1 times [2022-12-13 14:31:58,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:31:58,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186866546] [2022-12-13 14:31:58,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:31:58,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:31:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:58,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:31:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:58,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:31:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:58,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 14:31:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 14:31:58,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:31:58,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186866546] [2022-12-13 14:31:58,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186866546] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:31:58,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813971080] [2022-12-13 14:31:58,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:31:58,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:31:58,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:31:58,533 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:31:58,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 14:31:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:58,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 14:31:58,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:31:58,641 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 14:31:58,651 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 14:31:58,669 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_521))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 14:31:58,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:31:58,709 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 14:31:58,720 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_522))) is different from true [2022-12-13 14:31:58,729 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_522))) is different from true [2022-12-13 14:31:58,743 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 14:31:58,743 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 14:31:58,785 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-12-13 14:31:58,803 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 14:31:58,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 14:31:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2022-12-13 14:31:58,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:31:59,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813971080] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:31:59,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 14:31:59,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2022-12-13 14:31:59,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397442277] [2022-12-13 14:31:59,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 14:31:59,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 14:31:59,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:31:59,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 14:31:59,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=272, Unknown=4, NotChecked=148, Total=506 [2022-12-13 14:31:59,118 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 14:31:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:31:59,482 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2022-12-13 14:31:59,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:31:59,483 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-12-13 14:31:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:31:59,484 INFO L225 Difference]: With dead ends: 126 [2022-12-13 14:31:59,484 INFO L226 Difference]: Without dead ends: 126 [2022-12-13 14:31:59,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=363, Unknown=4, NotChecked=172, Total=650 [2022-12-13 14:31:59,485 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 278 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 522 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:31:59,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 350 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 450 Invalid, 0 Unknown, 522 Unchecked, 0.3s Time] [2022-12-13 14:31:59,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-12-13 14:31:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2022-12-13 14:31:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 103 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 14:31:59,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2022-12-13 14:31:59,489 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 37 [2022-12-13 14:31:59,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:31:59,490 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2022-12-13 14:31:59,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 14:31:59,490 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-12-13 14:31:59,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 14:31:59,490 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:31:59,490 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:31:59,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 14:31:59,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:31:59,691 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:31:59,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:31:59,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1086704928, now seen corresponding path program 1 times [2022-12-13 14:31:59,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:31:59,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961411149] [2022-12-13 14:31:59,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:31:59,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:31:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:31:59,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:31:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:00,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:32:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:00,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 14:32:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 14:32:00,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:32:00,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961411149] [2022-12-13 14:32:00,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961411149] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:00,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137291897] [2022-12-13 14:32:00,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:00,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:00,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:32:00,147 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:32:00,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 14:32:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:00,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 14:32:00,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:32:00,260 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 14:32:00,270 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 14:32:00,284 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_686 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_686) |c_#length|)))) is different from true [2022-12-13 14:32:00,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:00,320 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 14:32:00,339 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 14:32:00,346 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_687 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_687))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 14:32:00,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:00,381 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 14:32:00,434 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 14:32:00,441 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 14:32:00,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:00,474 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 14:32:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2022-12-13 14:32:00,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:32:00,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137291897] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:00,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 14:32:00,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2022-12-13 14:32:00,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24272086] [2022-12-13 14:32:00,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 14:32:00,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 14:32:00,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:32:00,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 14:32:00,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=171, Unknown=3, NotChecked=84, Total=306 [2022-12-13 14:32:00,551 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 16 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 14:32:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:32:00,866 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2022-12-13 14:32:00,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 14:32:00,867 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2022-12-13 14:32:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:32:00,868 INFO L225 Difference]: With dead ends: 117 [2022-12-13 14:32:00,868 INFO L226 Difference]: Without dead ends: 117 [2022-12-13 14:32:00,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=243, Unknown=3, NotChecked=102, Total=420 [2022-12-13 14:32:00,869 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 257 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:32:00,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 350 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 489 Invalid, 0 Unknown, 303 Unchecked, 0.3s Time] [2022-12-13 14:32:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-13 14:32:00,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2022-12-13 14:32:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 14:32:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-12-13 14:32:00,873 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 37 [2022-12-13 14:32:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:32:00,873 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-12-13 14:32:00,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 14:32:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-12-13 14:32:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 14:32:00,874 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:32:00,875 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:32:00,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 14:32:01,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:01,076 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:32:01,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:32:01,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1436990998, now seen corresponding path program 1 times [2022-12-13 14:32:01,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:32:01,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144090959] [2022-12-13 14:32:01,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:01,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:32:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:01,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:32:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:01,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:32:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:01,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 14:32:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 14:32:01,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:32:01,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144090959] [2022-12-13 14:32:01,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144090959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:32:01,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:32:01,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:32:01,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221073423] [2022-12-13 14:32:01,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:32:01,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:32:01,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:32:01,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:32:01,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:32:01,195 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 14:32:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:32:01,326 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2022-12-13 14:32:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:32:01,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-12-13 14:32:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:32:01,327 INFO L225 Difference]: With dead ends: 115 [2022-12-13 14:32:01,327 INFO L226 Difference]: Without dead ends: 115 [2022-12-13 14:32:01,327 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 14:32:01,327 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 77 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:32:01,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 289 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:32:01,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-12-13 14:32:01,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2022-12-13 14:32:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 92 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 14:32:01,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-12-13 14:32:01,330 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 40 [2022-12-13 14:32:01,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:32:01,330 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-12-13 14:32:01,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 14:32:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-12-13 14:32:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 14:32:01,331 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:32:01,332 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:32:01,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 14:32:01,332 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:32:01,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:32:01,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1436990997, now seen corresponding path program 1 times [2022-12-13 14:32:01,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:32:01,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878347117] [2022-12-13 14:32:01,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:01,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:32:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:01,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:32:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:01,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:32:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:01,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 14:32:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 14:32:01,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:32:01,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878347117] [2022-12-13 14:32:01,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878347117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:32:01,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:32:01,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:32:01,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870498161] [2022-12-13 14:32:01,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:32:01,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:32:01,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:32:01,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:32:01,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:32:01,483 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 14:32:01,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:32:01,613 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2022-12-13 14:32:01,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:32:01,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-12-13 14:32:01,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:32:01,614 INFO L225 Difference]: With dead ends: 95 [2022-12-13 14:32:01,614 INFO L226 Difference]: Without dead ends: 95 [2022-12-13 14:32:01,614 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 14:32:01,614 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 78 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:32:01,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 300 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:32:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-12-13 14:32:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-12-13 14:32:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 90 states have internal predecessors, (98), 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 14:32:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2022-12-13 14:32:01,618 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 40 [2022-12-13 14:32:01,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:32:01,618 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2022-12-13 14:32:01,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 14:32:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2022-12-13 14:32:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 14:32:01,619 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:32:01,619 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:32:01,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 14:32:01,619 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:32:01,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:32:01,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1596801691, now seen corresponding path program 1 times [2022-12-13 14:32:01,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:32:01,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446145007] [2022-12-13 14:32:01,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:01,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:32:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:01,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:32:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:01,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:32:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:01,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 14:32:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 14:32:02,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:32:02,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446145007] [2022-12-13 14:32:02,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446145007] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:02,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673591018] [2022-12-13 14:32:02,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:02,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:02,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:32:02,079 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:32:02,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 14:32:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:02,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 14:32:02,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:32:02,318 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 14:32:02,408 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1056 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1056))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-12-13 14:32:02,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:02,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 14:32:02,442 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-13 14:32:02,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 14:32:02,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 14:32:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 14:32:02,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:32:02,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673591018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:32:02,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:32:02,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-12-13 14:32:02,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278337807] [2022-12-13 14:32:02,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:32:02,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 14:32:02,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:32:02,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 14:32:02,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2022-12-13 14:32:02,522 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 14:32:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:32:03,018 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2022-12-13 14:32:03,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 14:32:03,018 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-12-13 14:32:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:32:03,019 INFO L225 Difference]: With dead ends: 145 [2022-12-13 14:32:03,019 INFO L226 Difference]: Without dead ends: 145 [2022-12-13 14:32:03,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=811, Unknown=2, NotChecked=58, Total=992 [2022-12-13 14:32:03,020 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 89 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:32:03,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 904 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 804 Invalid, 3 Unknown, 177 Unchecked, 0.4s Time] [2022-12-13 14:32:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-12-13 14:32:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 94. [2022-12-13 14:32:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 89 states have internal predecessors, (98), 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 14:32:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-12-13 14:32:03,024 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 41 [2022-12-13 14:32:03,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:32:03,024 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-12-13 14:32:03,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 14:32:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-12-13 14:32:03,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 14:32:03,024 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:32:03,025 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:32:03,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 14:32:03,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 14:32:03,226 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:32:03,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:32:03,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1596801690, now seen corresponding path program 1 times [2022-12-13 14:32:03,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:32:03,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679163453] [2022-12-13 14:32:03,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:03,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:32:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:03,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:32:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:03,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:32:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:03,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 14:32:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:04,029 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 14:32:04,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:32:04,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679163453] [2022-12-13 14:32:04,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679163453] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:04,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136007556] [2022-12-13 14:32:04,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:04,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:04,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:32:04,031 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:32:04,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 14:32:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:04,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-13 14:32:04,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:32:04,419 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 14:32:04,422 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 14:32:04,549 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1215 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1215))) (exists ((v_ArrVal_1211 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1211) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1214 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1214))))) is different from true [2022-12-13 14:32:04,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:04,583 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 14:32:04,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:04,590 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 14:32:04,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:04,595 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 14:32:04,602 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 14:32:04,602 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 14:32:04,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 14:32:04,645 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 14:32:04,697 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-12-13 14:32:04,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:32:04,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136007556] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:04,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 14:32:04,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2022-12-13 14:32:04,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199949650] [2022-12-13 14:32:04,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 14:32:04,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 14:32:04,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:32:04,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 14:32:04,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1222, Unknown=2, NotChecked=70, Total=1406 [2022-12-13 14:32:04,937 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 14:32:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:32:06,328 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2022-12-13 14:32:06,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 14:32:06,328 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-12-13 14:32:06,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:32:06,329 INFO L225 Difference]: With dead ends: 158 [2022-12-13 14:32:06,329 INFO L226 Difference]: Without dead ends: 158 [2022-12-13 14:32:06,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=331, Invalid=2638, Unknown=5, NotChecked=106, Total=3080 [2022-12-13 14:32:06,329 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 637 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 14:32:06,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1386 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1452 Invalid, 3 Unknown, 167 Unchecked, 0.7s Time] [2022-12-13 14:32:06,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-12-13 14:32:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 102. [2022-12-13 14:32:06,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 14:32:06,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2022-12-13 14:32:06,332 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 41 [2022-12-13 14:32:06,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:32:06,332 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2022-12-13 14:32:06,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 14:32:06,332 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-12-13 14:32:06,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 14:32:06,333 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:32:06,333 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:32:06,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 14:32:06,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 14:32:06,533 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:32:06,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:32:06,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1993086700, now seen corresponding path program 1 times [2022-12-13 14:32:06,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:32:06,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867985483] [2022-12-13 14:32:06,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:06,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:32:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:06,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:32:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:06,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:32:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:06,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 14:32:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 14:32:07,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:32:07,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867985483] [2022-12-13 14:32:07,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867985483] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:07,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030313758] [2022-12-13 14:32:07,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:07,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:07,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:32:07,081 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:32:07,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 14:32:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:07,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 14:32:07,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:32:07,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 14:32:07,494 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1405 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1405) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 14:32:07,500 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1406 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1406))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 14:32:07,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:07,517 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 24 treesize of output 24 [2022-12-13 14:32:07,558 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 25 treesize of output 13 [2022-12-13 14:32:07,579 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-12-13 14:32:07,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:32:07,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030313758] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:07,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 14:32:07,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 34 [2022-12-13 14:32:07,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289403853] [2022-12-13 14:32:07,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 14:32:07,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 14:32:07,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:32:07,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 14:32:07,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1014, Unknown=11, NotChecked=130, Total=1260 [2022-12-13 14:32:07,714 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 14:32:08,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:32:08,541 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2022-12-13 14:32:08,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 14:32:08,542 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-12-13 14:32:08,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:32:08,543 INFO L225 Difference]: With dead ends: 104 [2022-12-13 14:32:08,543 INFO L226 Difference]: Without dead ends: 104 [2022-12-13 14:32:08,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=228, Invalid=1747, Unknown=13, NotChecked=174, Total=2162 [2022-12-13 14:32:08,544 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 351 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 200 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:32:08,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1009 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1005 Invalid, 0 Unknown, 200 Unchecked, 0.4s Time] [2022-12-13 14:32:08,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-12-13 14:32:08,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2022-12-13 14:32:08,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 14:32:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2022-12-13 14:32:08,546 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 44 [2022-12-13 14:32:08,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:32:08,546 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2022-12-13 14:32:08,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 14:32:08,546 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2022-12-13 14:32:08,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 14:32:08,547 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:32:08,547 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:32:08,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 14:32:08,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 14:32:08,749 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:32:08,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:32:08,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1144176968, now seen corresponding path program 1 times [2022-12-13 14:32:08,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:32:08,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386939952] [2022-12-13 14:32:08,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:08,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:32:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:09,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:32:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:09,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:32:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:09,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 14:32:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 14:32:09,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:32:09,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386939952] [2022-12-13 14:32:09,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386939952] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:09,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797422919] [2022-12-13 14:32:09,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:09,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:09,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:32:09,714 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:32:09,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 14:32:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:09,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 95 conjunts are in the unsatisfiable core [2022-12-13 14:32:09,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:32:09,851 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 14:32:10,000 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:32:10,000 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 14:32:10,080 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 14:32:10,187 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 14:32:10,187 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-13 14:32:10,335 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:32:10,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2022-12-13 14:32:10,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-12-13 14:32:10,343 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 14:32:10,480 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_1573 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1573) |c_#memory_$Pointer$.offset|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1572 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1572))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-12-13 14:32:10,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:10,517 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 14:32:10,517 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 45 treesize of output 43 [2022-12-13 14:32:10,545 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-12-13 14:32:10,546 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 14:32:10,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:10,550 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 14 treesize of output 16 [2022-12-13 14:32:10,682 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 14:32:10,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:32:10,964 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-12-13 14:32:10,964 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 36 [2022-12-13 14:32:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 14:32:11,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:32:11,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797422919] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:11,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 14:32:11,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 48 [2022-12-13 14:32:11,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415612380] [2022-12-13 14:32:11,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 14:32:11,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-13 14:32:11,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:32:11,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-13 14:32:11,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2476, Unknown=2, NotChecked=100, Total=2756 [2022-12-13 14:32:11,384 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 49 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 42 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 14:32:14,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:32:14,335 INFO L93 Difference]: Finished difference Result 207 states and 228 transitions. [2022-12-13 14:32:14,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 14:32:14,336 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 42 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-12-13 14:32:14,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:32:14,336 INFO L225 Difference]: With dead ends: 207 [2022-12-13 14:32:14,336 INFO L226 Difference]: Without dead ends: 207 [2022-12-13 14:32:14,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=493, Invalid=4477, Unknown=4, NotChecked=138, Total=5112 [2022-12-13 14:32:14,337 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 566 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 28 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:32:14,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1421 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1913 Invalid, 3 Unknown, 192 Unchecked, 1.3s Time] [2022-12-13 14:32:14,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-12-13 14:32:14,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 118. [2022-12-13 14:32:14,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 111 states have internal predecessors, (122), 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 14:32:14,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2022-12-13 14:32:14,340 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 46 [2022-12-13 14:32:14,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:32:14,340 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2022-12-13 14:32:14,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 42 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 14:32:14,340 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2022-12-13 14:32:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 14:32:14,341 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:32:14,341 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:32:14,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 14:32:14,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:14,543 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:32:14,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:32:14,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1144176969, now seen corresponding path program 1 times [2022-12-13 14:32:14,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:32:14,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071827636] [2022-12-13 14:32:14,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:14,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:32:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:15,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:32:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:15,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:32:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:15,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 14:32:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 14:32:15,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:32:15,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071827636] [2022-12-13 14:32:15,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071827636] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:15,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731044393] [2022-12-13 14:32:15,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:15,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:15,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:32:15,748 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:32:15,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 14:32:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:15,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 114 conjunts are in the unsatisfiable core [2022-12-13 14:32:15,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:32:15,898 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 14:32:16,118 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 14:32:16,119 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 14:32:16,222 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 14:32:16,227 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 14:32:16,341 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 14:32:16,341 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-12-13 14:32:16,346 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 14:32:16,562 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:32:16,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 38 [2022-12-13 14:32:16,567 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-12-13 14:32:16,727 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_1745 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1745) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1749 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1749) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1748 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1748))))) is different from true [2022-12-13 14:32:16,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:16,766 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 14:32:16,767 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 85 treesize of output 75 [2022-12-13 14:32:16,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:16,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:16,775 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 14:32:16,775 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 83 treesize of output 80 [2022-12-13 14:32:16,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:16,784 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 24 treesize of output 26 [2022-12-13 14:32:16,796 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-12-13 14:32:16,797 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 32 treesize of output 34 [2022-12-13 14:32:17,059 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:32:17,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 42 [2022-12-13 14:32:17,064 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-12-13 14:32:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 14:32:17,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:32:17,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731044393] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:17,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 14:32:17,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2022-12-13 14:32:17,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163523888] [2022-12-13 14:32:17,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 14:32:17,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-13 14:32:17,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:32:17,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-13 14:32:17,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2907, Unknown=2, NotChecked=108, Total=3192 [2022-12-13 14:32:17,619 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand has 51 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 44 states have internal predecessors, (79), 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 14:32:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:32:22,335 INFO L93 Difference]: Finished difference Result 243 states and 267 transitions. [2022-12-13 14:32:22,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 14:32:22,335 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 44 states have internal predecessors, (79), 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 46 [2022-12-13 14:32:22,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:32:22,336 INFO L225 Difference]: With dead ends: 243 [2022-12-13 14:32:22,336 INFO L226 Difference]: Without dead ends: 243 [2022-12-13 14:32:22,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=465, Invalid=5087, Unknown=2, NotChecked=146, Total=5700 [2022-12-13 14:32:22,337 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 613 mSDsluCounter, 2631 mSDsCounter, 0 mSdLazyCounter, 3642 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 2718 SdHoareTripleChecker+Invalid, 3801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:32:22,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 2718 Invalid, 3801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3642 Invalid, 0 Unknown, 124 Unchecked, 2.3s Time] [2022-12-13 14:32:22,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-12-13 14:32:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 117. [2022-12-13 14:32:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 89 states have (on average 1.348314606741573) internal successors, (120), 110 states have internal predecessors, (120), 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 14:32:22,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2022-12-13 14:32:22,340 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 46 [2022-12-13 14:32:22,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:32:22,340 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2022-12-13 14:32:22,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 44 states have internal predecessors, (79), 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 14:32:22,340 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2022-12-13 14:32:22,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 14:32:22,341 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:32:22,341 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:32:22,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 14:32:22,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 14:32:22,542 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:32:22,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:32:22,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1589162821, now seen corresponding path program 2 times [2022-12-13 14:32:22,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:32:22,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654672002] [2022-12-13 14:32:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:22,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:32:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:23,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:32:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:23,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:32:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:23,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 14:32:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 14:32:23,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:32:23,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654672002] [2022-12-13 14:32:23,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654672002] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:23,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145465085] [2022-12-13 14:32:23,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 14:32:23,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:23,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:32:23,713 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:32:23,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 14:32:23,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 14:32:23,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:32:23,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 136 conjunts are in the unsatisfiable core [2022-12-13 14:32:23,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:32:23,901 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 14:32:24,105 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:32:24,105 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 14:32:24,178 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 14:32:24,182 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 14:32:24,293 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 14:32:24,293 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2022-12-13 14:32:24,297 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 14:32:24,725 INFO L321 Elim1Store]: treesize reduction 72, result has 29.4 percent of original size [2022-12-13 14:32:24,725 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 78 [2022-12-13 14:32:24,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:24,737 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-13 14:32:24,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 53 [2022-12-13 14:32:24,750 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-12-13 14:32:24,750 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 20 treesize of output 22 [2022-12-13 14:32:25,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:25,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:25,607 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 14:32:25,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 30 [2022-12-13 14:32:25,935 INFO L321 Elim1Store]: treesize reduction 102, result has 15.7 percent of original size [2022-12-13 14:32:25,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 57 [2022-12-13 14:32:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:32:26,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:32:26,218 INFO L321 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-12-13 14:32:26,218 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 24 treesize of output 23 [2022-12-13 14:32:26,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145465085] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:26,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 14:32:26,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 58 [2022-12-13 14:32:26,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205112043] [2022-12-13 14:32:26,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 14:32:26,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-12-13 14:32:26,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:32:26,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-12-13 14:32:26,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=4463, Unknown=4, NotChecked=0, Total=4692 [2022-12-13 14:32:26,761 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand has 58 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 51 states have internal predecessors, (89), 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 14:32:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:32:32,868 INFO L93 Difference]: Finished difference Result 175 states and 194 transitions. [2022-12-13 14:32:32,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 14:32:32,869 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 51 states have internal predecessors, (89), 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 51 [2022-12-13 14:32:32,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:32:32,869 INFO L225 Difference]: With dead ends: 175 [2022-12-13 14:32:32,869 INFO L226 Difference]: Without dead ends: 175 [2022-12-13 14:32:32,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2099 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=585, Invalid=8340, Unknown=5, NotChecked=0, Total=8930 [2022-12-13 14:32:32,871 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 444 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 2639 mSolverCounterSat, 24 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2639 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-13 14:32:32,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1882 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2639 Invalid, 3 Unknown, 0 Unchecked, 1.8s Time] [2022-12-13 14:32:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-12-13 14:32:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 120. [2022-12-13 14:32:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 113 states have internal predecessors, (123), 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 14:32:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2022-12-13 14:32:32,874 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 51 [2022-12-13 14:32:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:32:32,874 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2022-12-13 14:32:32,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 51 states have internal predecessors, (89), 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 14:32:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2022-12-13 14:32:32,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 14:32:32,874 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:32:32,874 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:32:32,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 14:32:33,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 14:32:33,076 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:32:33,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:32:33,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1862680377, now seen corresponding path program 1 times [2022-12-13 14:32:33,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:32:33,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615420821] [2022-12-13 14:32:33,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:33,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:32:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:33,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:32:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:33,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:32:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:33,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 14:32:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 14:32:33,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:32:33,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615420821] [2022-12-13 14:32:33,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615420821] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:33,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842277045] [2022-12-13 14:32:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:33,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:33,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:32:33,705 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:32:33,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 14:32:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:33,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 14:32:33,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:32:33,888 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 14:32:34,046 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 14:32:34,085 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-13 14:32:34,085 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 25 treesize of output 20 [2022-12-13 14:32:34,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 14:32:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 14:32:34,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:32:34,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842277045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:32:34,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:32:34,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [21] total 29 [2022-12-13 14:32:34,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457996578] [2022-12-13 14:32:34,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:32:34,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 14:32:34,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:32:34,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 14:32:34,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2022-12-13 14:32:34,133 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 14:32:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:32:34,337 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2022-12-13 14:32:34,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 14:32:34,337 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-12-13 14:32:34,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:32:34,338 INFO L225 Difference]: With dead ends: 139 [2022-12-13 14:32:34,338 INFO L226 Difference]: Without dead ends: 139 [2022-12-13 14:32:34,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 14:32:34,339 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 248 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:32:34,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 346 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:32:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-13 14:32:34,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 119. [2022-12-13 14:32:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.326086956521739) internal successors, (122), 112 states have internal predecessors, (122), 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 14:32:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2022-12-13 14:32:34,343 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 52 [2022-12-13 14:32:34,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:32:34,343 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2022-12-13 14:32:34,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 14:32:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2022-12-13 14:32:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 14:32:34,344 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:32:34,344 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:32:34,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 14:32:34,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 14:32:34,545 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:32:34,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:32:34,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1862680376, now seen corresponding path program 1 times [2022-12-13 14:32:34,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:32:34,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338500569] [2022-12-13 14:32:34,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:34,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:32:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:35,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:32:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:35,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:32:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:35,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 14:32:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 14:32:35,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:32:35,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338500569] [2022-12-13 14:32:35,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338500569] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:35,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449753434] [2022-12-13 14:32:35,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:35,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:35,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:32:35,381 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:32:35,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 14:32:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:35,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-13 14:32:35,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:32:35,575 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 14:32:35,795 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 14:32:35,800 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 14:32:35,856 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-13 14:32:35,856 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 25 treesize of output 20 [2022-12-13 14:32:35,868 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-13 14:32:35,868 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 23 treesize of output 18 [2022-12-13 14:32:35,941 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 14:32:35,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2022-12-13 14:32:35,944 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 14:32:35,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-12-13 14:32:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 14:32:35,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:32:35,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449753434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:32:35,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:32:35,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [21] total 31 [2022-12-13 14:32:35,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736648257] [2022-12-13 14:32:35,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:32:35,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 14:32:35,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:32:35,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 14:32:36,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=911, Unknown=0, NotChecked=0, Total=992 [2022-12-13 14:32:36,000 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 14:32:36,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:32:36,259 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2022-12-13 14:32:36,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 14:32:36,263 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-12-13 14:32:36,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:32:36,264 INFO L225 Difference]: With dead ends: 119 [2022-12-13 14:32:36,264 INFO L226 Difference]: Without dead ends: 119 [2022-12-13 14:32:36,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2022-12-13 14:32:36,264 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 179 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:32:36,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 351 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:32:36,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-13 14:32:36,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2022-12-13 14:32:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 110 states have internal predecessors, (120), 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 14:32:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2022-12-13 14:32:36,267 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 52 [2022-12-13 14:32:36,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:32:36,267 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2022-12-13 14:32:36,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 14:32:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2022-12-13 14:32:36,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 14:32:36,267 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:32:36,267 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:32:36,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 14:32:36,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:36,468 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:32:36,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:32:36,470 INFO L85 PathProgramCache]: Analyzing trace with hash 965522297, now seen corresponding path program 1 times [2022-12-13 14:32:36,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:32:36,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871450787] [2022-12-13 14:32:36,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:36,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:32:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:36,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:32:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:37,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:32:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:37,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 14:32:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 14:32:37,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:32:37,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871450787] [2022-12-13 14:32:37,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871450787] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:37,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587127129] [2022-12-13 14:32:37,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:37,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:37,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:32:37,328 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:32:37,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 14:32:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:37,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 90 conjunts are in the unsatisfiable core [2022-12-13 14:32:37,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:32:37,548 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 14:32:37,676 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:32:37,676 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 14:32:37,738 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 14:32:37,826 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 14:32:37,827 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-12-13 14:32:37,936 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:32:37,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 17 [2022-12-13 14:32:37,940 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 14:32:38,023 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2533 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2534)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2533)))) is different from true [2022-12-13 14:32:38,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:38,055 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 14:32:38,056 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 36 treesize of output 40 [2022-12-13 14:32:38,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:38,060 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 34 treesize of output 34 [2022-12-13 14:32:38,069 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 14:32:38,069 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 14:32:38,105 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 35 treesize of output 23 [2022-12-13 14:32:38,194 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:32:38,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2022-12-13 14:32:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 14:32:38,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:32:38,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587127129] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:38,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 14:32:38,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 46 [2022-12-13 14:32:38,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169808112] [2022-12-13 14:32:38,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 14:32:38,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-13 14:32:38,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:32:38,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-13 14:32:38,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2290, Unknown=1, NotChecked=96, Total=2550 [2022-12-13 14:32:38,452 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 14:32:39,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:32:39,627 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2022-12-13 14:32:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 14:32:39,627 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2022-12-13 14:32:39,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:32:39,627 INFO L225 Difference]: With dead ends: 120 [2022-12-13 14:32:39,627 INFO L226 Difference]: Without dead ends: 120 [2022-12-13 14:32:39,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=320, Invalid=3715, Unknown=1, NotChecked=124, Total=4160 [2022-12-13 14:32:39,628 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 155 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 14:32:39,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1564 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1505 Invalid, 0 Unknown, 102 Unchecked, 0.6s Time] [2022-12-13 14:32:39,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-12-13 14:32:39,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2022-12-13 14:32:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 110 states have internal predecessors, (119), 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 14:32:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2022-12-13 14:32:39,631 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 54 [2022-12-13 14:32:39,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:32:39,631 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2022-12-13 14:32:39,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 14:32:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2022-12-13 14:32:39,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 14:32:39,632 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:32:39,632 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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 14:32:39,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 14:32:39,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:39,833 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:32:39,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:32:39,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2042113126, now seen corresponding path program 3 times [2022-12-13 14:32:39,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:32:39,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918214291] [2022-12-13 14:32:39,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:39,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:32:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:39,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:32:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:39,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:32:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:39,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 14:32:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:39,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 14:32:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 14:32:39,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:32:39,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918214291] [2022-12-13 14:32:39,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918214291] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:39,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54091121] [2022-12-13 14:32:39,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 14:32:39,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:39,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:32:39,941 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:32:39,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 14:32:40,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 14:32:40,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:32:40,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 14:32:40,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:32:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 14:32:40,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:32:40,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54091121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:32:40,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:32:40,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-12-13 14:32:40,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781719968] [2022-12-13 14:32:40,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:32:40,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:32:40,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:32:40,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:32:40,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:32:40,205 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 14:32:40,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:32:40,216 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2022-12-13 14:32:40,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:32:40,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-12-13 14:32:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:32:40,217 INFO L225 Difference]: With dead ends: 85 [2022-12-13 14:32:40,217 INFO L226 Difference]: Without dead ends: 85 [2022-12-13 14:32:40,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:32:40,218 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:32:40,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 99 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:32:40,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-12-13 14:32:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-12-13 14:32:40,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 80 states have internal predecessors, (85), 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 14:32:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2022-12-13 14:32:40,221 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 58 [2022-12-13 14:32:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:32:40,221 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2022-12-13 14:32:40,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 14:32:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2022-12-13 14:32:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 14:32:40,222 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:32:40,222 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:32:40,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 14:32:40,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 14:32:40,423 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 14:32:40,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:32:40,424 INFO L85 PathProgramCache]: Analyzing trace with hash -214738826, now seen corresponding path program 1 times [2022-12-13 14:32:40,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:32:40,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031842668] [2022-12-13 14:32:40,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:40,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:32:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:41,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 14:32:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:41,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:32:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:41,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 14:32:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 14:32:42,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:32:42,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031842668] [2022-12-13 14:32:42,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031842668] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:32:42,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377937585] [2022-12-13 14:32:42,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:32:42,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:32:42,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:32:42,400 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:32:42,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5c6c-9861-44c6-ad37-6b4dc1f70fd1/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 14:32:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:32:42,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 182 conjunts are in the unsatisfiable core [2022-12-13 14:32:42,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:32:42,589 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 14:32:42,640 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 14:32:42,673 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 14:32:42,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:42,778 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 14:32:42,877 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 14:32:42,879 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 14:32:43,086 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 14:32:43,086 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 14:32:43,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:43,094 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 12 treesize of output 14 [2022-12-13 14:32:43,236 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 14:32:43,399 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 14:32:43,399 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2022-12-13 14:32:43,664 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:32:43,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2022-12-13 14:32:43,667 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 14:32:43,671 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 14:32:43,675 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 14:32:43,933 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 13 treesize of output 9 [2022-12-13 14:32:44,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:44,184 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-13 14:32:44,184 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 56 [2022-12-13 14:32:44,202 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 14:32:44,202 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 28 treesize of output 30 [2022-12-13 14:32:44,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:44,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 14 treesize of output 16 [2022-12-13 14:32:44,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:44,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 14:32:45,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:45,178 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 0 case distinctions, treesize of input 38 treesize of output 21 [2022-12-13 14:32:45,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:45,485 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 13 treesize of output 9 [2022-12-13 14:32:45,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:45,667 INFO L321 Elim1Store]: treesize reduction 86, result has 3.4 percent of original size [2022-12-13 14:32:45,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 99 treesize of output 48 [2022-12-13 14:32:45,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:45,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-12-13 14:32:46,023 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 14:32:46,029 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 14:32:46,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:46,037 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 14:32:46,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:46,138 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 44 treesize of output 31 [2022-12-13 14:32:46,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:46,145 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 30 treesize of output 21 [2022-12-13 14:32:46,150 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 14:32:46,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:46,334 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2022-12-13 14:32:46,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:32:46,339 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 33 treesize of output 13 [2022-12-13 14:32:46,386 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 14:32:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 18 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:32:46,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:32:46,725 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 230 treesize of output 226 [2022-12-13 14:32:46,729 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 526 treesize of output 510 [2022-12-13 14:32:48,459 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse34 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse5 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse23 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse26 (not .cse23)) (.cse27 (not .cse5)) (.cse47 (forall ((v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse64 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (let ((.cse63 (select .cse64 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse65 (+ v_arrayElimCell_156 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse63 .cse34)) (= (select (select .cse64 v_arrayElimCell_155) .cse65) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse63 .cse65))))))) (.cse49 (forall ((v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse62 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (let ((.cse60 (select .cse62 v_arrayElimCell_155)) (.cse61 (+ v_arrayElimCell_156 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse60 .cse34)) (= (select .cse60 .cse61) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse62 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse61))))))) (.cse48 (forall ((v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse58 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969)) (.cse59 (+ v_arrayElimCell_156 4))) (or (= (select (select .cse58 v_arrayElimCell_155) .cse59) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse58 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse59)))))) (.cse54 (forall ((v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse57 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (let ((.cse55 (select .cse57 v_arrayElimCell_155))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse56 (+ v_arrayElimCell_156 4))) (or (= (select .cse55 .cse56) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse57 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse56))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse55 .cse34))))))) (.cse1 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse25 (forall ((v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse34)))) (.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (or (not .cse1) .cse25 (not .cse2))) (.cse12 (or .cse5 .cse54)) (.cse17 (or .cse54 .cse23)) (.cse10 (or .cse5 .cse48)) (.cse11 (or .cse5 .cse49)) (.cse13 (forall ((v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse53 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (let ((.cse50 (select .cse53 v_arrayElimCell_155)) (.cse51 (select .cse53 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse52 (+ v_arrayElimCell_156 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse50 .cse34)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse51 .cse34)) (= (select .cse50 .cse52) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse51 .cse52))))))) (.cse18 (or .cse49 .cse23)) (.cse19 (or .cse48 .cse23)) (.cse9 (or .cse47 .cse23)) (.cse22 (or .cse5 .cse47)) (.cse4 (forall ((v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (let ((.cse45 (select .cse46 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_155 Int)) (let ((.cse43 (select .cse46 v_arrayElimCell_155))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse44 (+ v_arrayElimCell_156 4))) (or (= (select .cse43 .cse44) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 .cse44))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse43 .cse34))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 .cse34))))))) (.cse14 (or .cse26 .cse27 (forall ((v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse42 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (let ((.cse41 (select .cse42 v_arrayElimCell_155))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse41 .cse34)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse34)) (= (select .cse41 (+ v_arrayElimCell_156 4)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) (let ((.cse0 (and .cse4 .cse14)) (.cse8 (forall ((v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (let ((.cse40 (select .cse38 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_155 Int) (v_arrayElimCell_156 Int)) (let ((.cse39 (+ v_arrayElimCell_156 4))) (or (= (select (select .cse38 v_arrayElimCell_155) .cse39) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse40 .cse39))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse40 .cse34))))))) (.cse3 (and .cse4 .cse9 .cse14 .cse22)) (.cse16 (and .cse10 .cse11 .cse13 .cse14 .cse18 .cse19)) (.cse15 (and .cse4 .cse12 .cse14 .cse17)) (.cse24 (let ((.cse32 (forall ((v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse36 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse34)) (forall ((v_arrayElimCell_155 Int) (v_arrayElimCell_156 Int)) (let ((.cse37 (select .cse36 v_arrayElimCell_155))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 .cse34)) (= (select .cse37 (+ v_arrayElimCell_156 4)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) (.cse29 (forall ((v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969) v_arrayElimCell_155) (+ v_arrayElimCell_156 4)) |c_ULTIMATE.start_main_~uneq~0#1|))) (.cse30 (forall ((v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969) v_arrayElimCell_155))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 .cse34)) (= (select .cse35 (+ v_arrayElimCell_156 4)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (let ((.cse31 (and .cse29 .cse30)) (.cse28 (and (forall ((v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse33 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse34)) (forall ((v_arrayElimCell_155 Int) (v_arrayElimCell_156 Int)) (= (select (select .cse33 v_arrayElimCell_155) (+ v_arrayElimCell_156 4)) |c_ULTIMATE.start_main_~uneq~0#1|))))) .cse32))) (and (or .cse1 .cse28) (or .cse2 (and .cse29 .cse30 (or .cse1 .cse31))) (or (and .cse29 .cse30 (or .cse2 .cse31)) .cse1) (or .cse2 .cse28) .cse32 .cse7)))) (.cse20 (or .cse25 .cse26 .cse27))) (and (or .cse0 .cse1) (or .cse2 .cse3) .cse4 (or .cse0 .cse2) (or .cse5 (let ((.cse6 (and .cse4 .cse8 .cse9))) (and .cse4 (or .cse6 .cse2) (or .cse1 .cse6) .cse7))) (or .cse2 (and .cse4 .cse10 .cse11 .cse12 .cse13 .cse14 (or .cse15 .cse1) (or .cse1 .cse16) .cse17 .cse18 .cse19 .cse20)) (or (let ((.cse21 (and .cse4 .cse8 .cse22))) (and .cse4 (or .cse1 .cse21) (or .cse21 .cse2) .cse7)) .cse23) (or .cse5 .cse24) (or .cse1 .cse3) (or .cse1 (and .cse4 .cse10 .cse11 (or .cse2 .cse16) .cse12 .cse13 .cse14 (or .cse15 .cse2) .cse17 .cse18 .cse19 .cse20)) .cse14 (or .cse24 .cse23) .cse20 .cse7))))) is different from false [2022-12-13 14:33:09,924 WARN L233 SmtUtils]: Spent 17.73s on a formula simplification. DAG size of input: 122 DAG size of output: 118 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:33:37,959 WARN L233 SmtUtils]: Spent 12.34s on a formula simplification. DAG size of input: 129 DAG size of output: 129 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:33:54,477 WARN L233 SmtUtils]: Spent 13.90s on a formula simplification. DAG size of input: 137 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:34:15,072 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse45 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse45)) (.cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse45))) (or (not (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (not (<= (+ .cse2 4) (select |c_#length| .cse1))) (let ((.cse17 (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse13 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse16 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (let ((.cse30 (forall ((v_ArrVal_2958 Int) (v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse43 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969))) (let ((.cse44 (select .cse43 v_arrayElimCell_155))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse43 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse13)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse44 (+ v_arrayElimCell_156 4))) (= (select .cse44 .cse13) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse8 (not .cse17))) (let ((.cse19 (forall ((v_ArrVal_2958 Int) (v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969))) (let ((.cse39 (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse40 (+ v_arrayElimCell_156 4)) (.cse41 (select .cse42 v_arrayElimCell_155))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse39 .cse13)) (= (select .cse39 .cse40) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse41 .cse40)) (= (select .cse41 .cse13) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse6 (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (forall ((v_ArrVal_2958 Int) (v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse13)))) (.cse3 (forall ((v_ArrVal_2958 Int) (v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969))) (let ((.cse35 (select .cse38 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_155 Int)) (let ((.cse37 (select .cse38 v_arrayElimCell_155))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse36 (+ v_arrayElimCell_156 4))) (or (= (select .cse35 .cse36) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 .cse36))))) (= (select .cse37 .cse13) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 .cse13))))))) (.cse22 (or .cse30 .cse8))) (let ((.cse18 (and .cse3 .cse22)) (.cse11 (or (not .cse9) (not .cse4) .cse5)) (.cse25 (forall ((v_ArrVal_2958 Int) (v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969))) (or (forall ((v_arrayElimCell_155 Int) (v_arrayElimCell_156 Int)) (let ((.cse33 (select .cse34 v_arrayElimCell_155))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 (+ v_arrayElimCell_156 4))) (= (select .cse33 .cse13) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse34 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse13)))))) (.cse7 (not .cse6)) (.cse21 (and .cse3 .cse30)) (.cse23 (or (forall ((v_ArrVal_2958 Int) (v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse31 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969)) (.cse32 (+ v_arrayElimCell_156 4))) (or (= (select (select .cse31 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse32) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse31 v_arrayElimCell_155) .cse32))))) .cse17)) (.cse20 (and .cse19 .cse30)) (.cse24 (or .cse8 .cse5))) (and (or (and .cse3 .cse4 .cse5) .cse6) (or .cse7 .cse8 .cse5) (or (let ((.cse10 (and (forall ((v_ArrVal_2958 Int) (v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969))) (let ((.cse12 (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 .cse13)) (forall ((v_arrayElimCell_155 Int) (v_arrayElimCell_156 Int)) (let ((.cse14 (+ v_arrayElimCell_156 4))) (or (= (select .cse12 .cse14) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse15 v_arrayElimCell_155) .cse14))))))))) .cse3))) (and (or .cse9 .cse10) .cse11 .cse3 (or .cse4 .cse10))) .cse17) (or .cse4 .cse18) .cse11 (or .cse9 .cse18) .cse3 (or .cse4 (and .cse19 (or .cse9 .cse20) .cse3 (or .cse9 .cse21) .cse22 .cse23 .cse24)) (or (and .cse25 .cse5) .cse6) (or (let ((.cse27 (forall ((v_ArrVal_2958 Int) (v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969) v_arrayElimCell_155) (+ v_arrayElimCell_156 4))))) (.cse26 (and (forall ((v_ArrVal_2958 Int) (v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969))) (or (forall ((v_arrayElimCell_155 Int) (v_arrayElimCell_156 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse29 v_arrayElimCell_155) (+ v_arrayElimCell_156 4)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse29 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse13))))) .cse25))) (and (or .cse26 .cse4) (or .cse9 .cse27) .cse11 (or (and (forall ((v_ArrVal_2958 Int) (v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse28 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969) v_arrayElimCell_155))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ v_arrayElimCell_156 4))) (= (select .cse28 .cse13) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse9 .cse27) .cse4) .cse25 (or .cse9 .cse26))) .cse17) (or .cse7 .cse30 .cse8) (or .cse9 (and .cse19 (or .cse21 .cse4) .cse3 .cse6 .cse22 .cse23 (or .cse4 .cse20) .cse24))))))) (not (<= 0 .cse2)) (not (<= 0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem10#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem10#1.base| 0))))) is different from false [2022-12-13 14:34:15,908 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse45 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse45)) (.cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse45))) (or (not (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (not (<= (+ .cse2 4) (select |c_#length| .cse1))) (let ((.cse17 (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse13 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse16 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (let ((.cse30 (forall ((v_ArrVal_2958 Int) (v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse43 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969))) (let ((.cse44 (select .cse43 v_arrayElimCell_155))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse43 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse13)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse44 (+ v_arrayElimCell_156 4))) (= (select .cse44 .cse13) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse8 (not .cse17))) (let ((.cse19 (forall ((v_ArrVal_2958 Int) (v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969))) (let ((.cse39 (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse40 (+ v_arrayElimCell_156 4)) (.cse41 (select .cse42 v_arrayElimCell_155))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse39 .cse13)) (= (select .cse39 .cse40) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse41 .cse40)) (= (select .cse41 .cse13) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse6 (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (forall ((v_ArrVal_2958 Int) (v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse13)))) (.cse3 (forall ((v_ArrVal_2958 Int) (v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969))) (let ((.cse35 (select .cse38 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_155 Int)) (let ((.cse37 (select .cse38 v_arrayElimCell_155))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse36 (+ v_arrayElimCell_156 4))) (or (= (select .cse35 .cse36) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 .cse36))))) (= (select .cse37 .cse13) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 .cse13))))))) (.cse22 (or .cse30 .cse8))) (let ((.cse18 (and .cse3 .cse22)) (.cse11 (or (not .cse9) (not .cse4) .cse5)) (.cse25 (forall ((v_ArrVal_2958 Int) (v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969))) (or (forall ((v_arrayElimCell_155 Int) (v_arrayElimCell_156 Int)) (let ((.cse33 (select .cse34 v_arrayElimCell_155))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 (+ v_arrayElimCell_156 4))) (= (select .cse33 .cse13) |c_ULTIMATE.start_main_~uneq~0#1|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse34 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse13)))))) (.cse7 (not .cse6)) (.cse21 (and .cse3 .cse30)) (.cse23 (or (forall ((v_ArrVal_2958 Int) (v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse31 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969)) (.cse32 (+ v_arrayElimCell_156 4))) (or (= (select (select .cse31 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse32) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse31 v_arrayElimCell_155) .cse32))))) .cse17)) (.cse20 (and .cse19 .cse30)) (.cse24 (or .cse8 .cse5))) (and (or (and .cse3 .cse4 .cse5) .cse6) (or .cse7 .cse8 .cse5) (or (let ((.cse10 (and (forall ((v_ArrVal_2958 Int) (v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969))) (let ((.cse12 (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 .cse13)) (forall ((v_arrayElimCell_155 Int) (v_arrayElimCell_156 Int)) (let ((.cse14 (+ v_arrayElimCell_156 4))) (or (= (select .cse12 .cse14) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse15 v_arrayElimCell_155) .cse14))))))))) .cse3))) (and (or .cse9 .cse10) .cse11 .cse3 (or .cse4 .cse10))) .cse17) (or .cse4 .cse18) .cse11 (or .cse9 .cse18) .cse3 (or .cse4 (and .cse19 (or .cse9 .cse20) .cse3 (or .cse9 .cse21) .cse22 .cse23 .cse24)) (or (and .cse25 .cse5) .cse6) (or (let ((.cse27 (forall ((v_ArrVal_2958 Int) (v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969) v_arrayElimCell_155) (+ v_arrayElimCell_156 4))))) (.cse26 (and (forall ((v_ArrVal_2958 Int) (v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969))) (or (forall ((v_arrayElimCell_155 Int) (v_arrayElimCell_156 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse29 v_arrayElimCell_155) (+ v_arrayElimCell_156 4)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse29 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse13))))) .cse25))) (and (or .cse26 .cse4) (or .cse9 .cse27) .cse11 (or (and (forall ((v_ArrVal_2958 Int) (v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse28 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2958)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) .cse1 v_ArrVal_2969) v_arrayElimCell_155))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ v_arrayElimCell_156 4))) (= (select .cse28 .cse13) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse9 .cse27) .cse4) .cse25 (or .cse9 .cse26))) .cse17) (or .cse7 .cse30 .cse8) (or .cse9 (and .cse19 (or .cse21 .cse4) .cse3 .cse6 .cse22 .cse23 (or .cse4 .cse20) .cse24))))))) (not (<= 0 .cse2)) (not (<= 0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (and (= .cse45 0) (= .cse0 0))))) is different from false [2022-12-13 14:34:26,851 WARN L233 SmtUtils]: Spent 7.48s on a formula simplification. DAG size of input: 160 DAG size of output: 157 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:35:04,841 WARN L233 SmtUtils]: Spent 37.26s on a formula simplification. DAG size of input: 644 DAG size of output: 524 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-13 14:35:04,843 INFO L321 Elim1Store]: treesize reduction 480, result has 63.7 percent of original size [2022-12-13 14:35:04,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 40 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 40 new quantified variables, introduced 80 case distinctions, treesize of input 7796 treesize of output 14491 [2022-12-13 14:35:38,991 INFO L217 Elim1Store]: Index analysis took 16424 ms [2022-12-13 14:36:33,266 WARN L233 SmtUtils]: Spent 54.26s on a formula simplification. DAG size of input: 1821 DAG size of output: 82 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-13 14:36:33,267 INFO L321 Elim1Store]: treesize reduction 5568, result has 2.2 percent of original size [2022-12-13 14:36:33,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 39 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 255 case distinctions, treesize of input 16452 treesize of output 21591 [2022-12-13 14:36:37,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:36:37,175 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 15451 treesize of output 15444 [2022-12-13 14:36:41,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:36:41,268 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 15435 treesize of output 15412 [2022-12-13 14:37:49,824 INFO L217 Elim1Store]: Index analysis took 634 ms [2022-12-13 14:39:11,571 WARN L233 SmtUtils]: Spent 1.36m on a formula simplification. DAG size of input: 5015 DAG size of output: 298 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-13 14:39:11,572 INFO L321 Elim1Store]: treesize reduction 15483, result has 3.1 percent of original size [2022-12-13 14:39:11,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 22 stores, 25 select indices, 25 select index equivalence classes, 0 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 828 case distinctions, treesize of input 68960 treesize of output 69554 [2022-12-13 14:39:15,710 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 67909 treesize of output 67877 [2022-12-13 14:39:17,991 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 67877 treesize of output 67813 [2022-12-13 14:39:20,176 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 67813 treesize of output 67685 [2022-12-13 14:39:22,390 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 67685 treesize of output 67621 [2022-12-13 14:39:27,962 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 67630 treesize of output 67622 [2022-12-13 14:39:36,695 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:39:36,698 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 67655 treesize of output 67657 [2022-12-13 14:39:38,447 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 67639 treesize of output 67635 [2022-12-13 14:39:40,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:39:40,389 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 67635 treesize of output 67380 [2022-12-13 14:39:42,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:39:42,412 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 67371 treesize of output 66852 [2022-12-13 14:39:50,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:39:50,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66873 treesize of output 66759 [2022-12-13 14:39:55,431 INFO L217 Elim1Store]: Index analysis took 484 ms [2022-12-13 14:40:15,978 WARN L233 SmtUtils]: Spent 20.53s on a formula simplification that was a NOOP. DAG size: 2179 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-13 14:40:15,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:40:15,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 33 select indices, 33 select index equivalence classes, 0 disjoint index pairs (out of 528 index pairs), introduced 33 new quantified variables, introduced 528 case distinctions, treesize of input 81856 treesize of output 85928 [2022-12-13 14:40:32,404 WARN L233 SmtUtils]: Spent 16.41s on a formula simplification. DAG size of input: 6658 DAG size of output: 6566 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:40:33,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:40:33,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81180 treesize of output 81194 [2022-12-13 14:40:41,328 WARN L233 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 6576 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:40:41,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:40:41,987 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 81172 treesize of output 81162 [2022-12-13 14:40:50,202 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 6579 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:40:50,985 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:40:50,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81156 treesize of output 81106 [2022-12-13 14:40:59,302 WARN L233 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 6590 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:41:00,043 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:41:00,046 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 81072 treesize of output 80945 [2022-12-13 14:41:08,358 WARN L233 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 6592 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:41:09,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:41:09,146 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 80936 treesize of output 80673 [2022-12-13 14:41:17,446 WARN L233 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 6594 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:41:18,198 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:41:18,203 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 80676 treesize of output 80650 [2022-12-13 14:41:26,508 WARN L233 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 6597 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:41:27,280 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:41:27,284 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 80632 treesize of output 80621 [2022-12-13 14:41:35,596 WARN L233 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 6600 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:41:36,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:41:36,427 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 80612 treesize of output 80581 [2022-12-13 14:41:44,723 WARN L233 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 6602 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:41:45,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:41:45,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80584 treesize of output 80594 [2022-12-13 14:41:53,792 WARN L233 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 6611 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:41:54,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:41:54,676 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 80560 treesize of output 80533 [2022-12-13 14:42:03,022 WARN L233 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 6614 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:42:03,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:42:03,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80536 treesize of output 80538 [2022-12-13 14:42:12,219 WARN L233 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 6624 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:42:13,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:42:13,126 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 80504 treesize of output 80441 [2022-12-13 14:42:21,512 WARN L233 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 6625 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:42:22,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:42:22,472 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 80432 treesize of output 80361 [2022-12-13 14:42:30,876 WARN L233 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 6628 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:42:31,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:42:31,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80364 treesize of output 80362 [2022-12-13 14:42:40,201 WARN L233 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 6638 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:42:41,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:42:41,167 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 80328 treesize of output 80297 [2022-12-13 14:42:49,639 WARN L233 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 6640 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:42:50,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:42:50,673 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 80288 treesize of output 80225 [2022-12-13 14:42:59,164 WARN L233 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 6643 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:43:00,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:43:00,149 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 80216 treesize of output 80153 [2022-12-13 14:43:08,639 WARN L233 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 6646 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:43:09,687 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:43:09,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80156 treesize of output 80162 [2022-12-13 14:43:18,232 WARN L233 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 6657 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:43:19,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:43:19,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80140 treesize of output 80122 [2022-12-13 14:43:27,984 WARN L233 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 6667 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:43:28,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:43:29,002 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 80088 treesize of output 80085 [2022-12-13 14:43:37,611 WARN L233 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 6670 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:43:38,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:43:38,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80088 treesize of output 80090 [2022-12-13 14:43:47,344 WARN L233 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 6680 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:43:48,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:43:48,349 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 80056 treesize of output 80041 [2022-12-13 14:43:57,014 WARN L233 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 6682 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:43:58,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:43:58,170 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 80032 treesize of output 79977 [2022-12-13 14:44:06,864 WARN L233 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 6685 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:44:07,735 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 79968 treesize of output 79960 [2022-12-13 14:44:16,422 WARN L233 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 6684 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:44:17,430 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:44:17,434 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 79972 treesize of output 79970 [2022-12-13 14:44:26,126 WARN L233 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 6687 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:44:27,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:44:27,138 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 79952 treesize of output 79945 [2022-12-13 14:44:35,861 WARN L233 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 6690 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:44:36,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:44:36,959 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 79936 treesize of output 79897 [2022-12-13 14:44:45,705 WARN L233 SmtUtils]: Spent 8.74s on a formula simplification that was a NOOP. DAG size: 6693 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:44:46,726 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:44:46,730 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 79888 treesize of output 79873 [2022-12-13 14:44:56,289 WARN L233 SmtUtils]: Spent 9.55s on a formula simplification that was a NOOP. DAG size: 6695 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:44:57,552 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:44:57,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79876 treesize of output 79874 [2022-12-13 14:45:06,356 WARN L233 SmtUtils]: Spent 8.79s on a formula simplification that was a NOOP. DAG size: 6705 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:45:07,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:45:07,519 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 79840 treesize of output 79817 [2022-12-13 14:45:16,472 WARN L233 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 6707 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:45:17,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:45:17,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79820 treesize of output 79770 [2022-12-13 14:45:26,817 WARN L233 SmtUtils]: Spent 9.10s on a formula simplification that was a NOOP. DAG size: 6718 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:45:28,021 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 79736 treesize of output 79728 [2022-12-13 14:45:37,512 WARN L233 SmtUtils]: Spent 9.48s on a formula simplification that was a NOOP. DAG size: 6717 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:45:38,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:45:38,695 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 79728 treesize of output 79601 [2022-12-13 14:45:48,015 WARN L233 SmtUtils]: Spent 9.31s on a formula simplification that was a NOOP. DAG size: 6719 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:45:49,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:45:49,533 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 79592 treesize of output 79569 [2022-12-13 14:45:59,641 WARN L233 SmtUtils]: Spent 10.10s on a formula simplification that was a NOOP. DAG size: 6721 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:46:00,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:46:00,651 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 79560 treesize of output 79409 [2022-12-13 14:46:10,127 WARN L233 SmtUtils]: Spent 9.47s on a formula simplification that was a NOOP. DAG size: 6724 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:46:11,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:46:11,260 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 79400 treesize of output 79329