./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a 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_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc --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 e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c --- 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-5e519f3 [2022-11-02 20:21:47,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:21:47,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:21:47,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:21:47,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:21:47,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:21:47,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:21:47,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:21:47,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:21:48,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:21:48,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:21:48,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:21:48,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:21:48,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:21:48,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:21:48,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:21:48,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:21:48,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:21:48,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:21:48,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:21:48,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:21:48,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:21:48,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:21:48,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:21:48,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:21:48,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:21:48,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:21:48,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:21:48,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:21:48,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:21:48,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:21:48,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:21:48,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:21:48,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:21:48,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:21:48,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:21:48,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:21:48,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:21:48,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:21:48,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:21:48,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:21:48,052 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:21:48,078 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:21:48,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:21:48,079 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:21:48,079 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:21:48,080 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:21:48,080 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:21:48,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:21:48,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:21:48,081 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:21:48,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:21:48,082 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:21:48,082 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:21:48,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:21:48,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:21:48,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:21:48,083 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:21:48,084 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:21:48,084 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:21:48,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:21:48,084 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:21:48,085 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:21:48,085 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:21:48,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:21:48,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:21:48,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:21:48,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:21:48,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:21:48,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:21:48,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:21:48,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:21:48,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/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_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc 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 -> e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c [2022-11-02 20:21:48,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:21:48,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:21:48,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:21:48,455 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:21:48,456 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:21:48,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2022-11-02 20:21:48,548 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/data/f155b9a7e/fbc9da692f214efb8cef2e57ec30e57b/FLAG87ebe0be1 [2022-11-02 20:21:49,354 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:21:49,355 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2022-11-02 20:21:49,387 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/data/f155b9a7e/fbc9da692f214efb8cef2e57ec30e57b/FLAG87ebe0be1 [2022-11-02 20:21:49,586 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/data/f155b9a7e/fbc9da692f214efb8cef2e57ec30e57b [2022-11-02 20:21:49,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:21:49,591 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:21:49,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:21:49,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:21:49,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:21:49,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:21:49" (1/1) ... [2022-11-02 20:21:49,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3503896a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:49, skipping insertion in model container [2022-11-02 20:21:49,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:21:49" (1/1) ... [2022-11-02 20:21:49,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:21:49,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:21:50,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:21:50,171 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:21:50,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:21:50,280 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:21:50,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:50 WrapperNode [2022-11-02 20:21:50,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:21:50,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:21:50,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:21:50,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:21:50,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:50" (1/1) ... [2022-11-02 20:21:50,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:50" (1/1) ... [2022-11-02 20:21:50,359 INFO L138 Inliner]: procedures = 123, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2022-11-02 20:21:50,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:21:50,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:21:50,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:21:50,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:21:50,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:50" (1/1) ... [2022-11-02 20:21:50,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:50" (1/1) ... [2022-11-02 20:21:50,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:50" (1/1) ... [2022-11-02 20:21:50,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:50" (1/1) ... [2022-11-02 20:21:50,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:50" (1/1) ... [2022-11-02 20:21:50,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:50" (1/1) ... [2022-11-02 20:21:50,399 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:50" (1/1) ... [2022-11-02 20:21:50,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:50" (1/1) ... [2022-11-02 20:21:50,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:21:50,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:21:50,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:21:50,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:21:50,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:50" (1/1) ... [2022-11-02 20:21:50,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:21:50,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:50,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:21:50,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:21:50,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:21:50,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:21:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:21:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:21:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:21:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:21:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:21:50,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:21:50,757 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:21:50,768 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:21:51,611 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:21:51,622 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:21:51,622 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-11-02 20:21:51,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:21:51 BoogieIcfgContainer [2022-11-02 20:21:51,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:21:51,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:21:51,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:21:51,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:21:51,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:21:49" (1/3) ... [2022-11-02 20:21:51,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1952777a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:21:51, skipping insertion in model container [2022-11-02 20:21:51,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:50" (2/3) ... [2022-11-02 20:21:51,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1952777a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:21:51, skipping insertion in model container [2022-11-02 20:21:51,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:21:51" (3/3) ... [2022-11-02 20:21:51,642 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2022-11-02 20:21:51,665 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:21:51,665 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2022-11-02 20:21:51,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:21:51,741 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@222a0c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:21:51,742 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-11-02 20:21:51,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 105 states have (on average 2.219047619047619) internal successors, (233), 209 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:51,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:21:51,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:51,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:21:51,758 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-02 20:21:51,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:51,765 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-02 20:21:51,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:51,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160545731] [2022-11-02 20:21:51,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:51,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:52,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:52,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160545731] [2022-11-02 20:21:52,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160545731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:52,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:52,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:21:52,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301728755] [2022-11-02 20:21:52,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:52,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:21:52,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:52,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:21:52,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:21:52,178 INFO L87 Difference]: Start difference. First operand has 210 states, 105 states have (on average 2.219047619047619) internal successors, (233), 209 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:52,603 INFO L93 Difference]: Finished difference Result 282 states and 304 transitions. [2022-11-02 20:21:52,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:21:52,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:21:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:52,621 INFO L225 Difference]: With dead ends: 282 [2022-11-02 20:21:52,621 INFO L226 Difference]: Without dead ends: 278 [2022-11-02 20:21:52,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:21:52,628 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 200 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:52,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 199 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:21:52,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-02 20:21:52,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 199. [2022-11-02 20:21:52,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 104 states have (on average 2.0673076923076925) internal successors, (215), 198 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:52,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2022-11-02 20:21:52,688 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 3 [2022-11-02 20:21:52,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:52,688 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2022-11-02 20:21:52,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:52,689 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2022-11-02 20:21:52,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:21:52,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:52,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:21:52,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:21:52,691 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-02 20:21:52,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:52,692 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-02 20:21:52,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:52,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089929459] [2022-11-02 20:21:52,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:52,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:52,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:52,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089929459] [2022-11-02 20:21:52,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089929459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:52,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:52,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:21:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530122] [2022-11-02 20:21:52,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:52,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:21:52,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:52,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:21:52,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:21:52,791 INFO L87 Difference]: Start difference. First operand 199 states and 215 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:53,025 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2022-11-02 20:21:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:21:53,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:21:53,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:53,029 INFO L225 Difference]: With dead ends: 197 [2022-11-02 20:21:53,029 INFO L226 Difference]: Without dead ends: 197 [2022-11-02 20:21:53,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:21:53,031 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 2 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:53,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:21:53,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-02 20:21:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-11-02 20:21:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 104 states have (on average 2.048076923076923) internal successors, (213), 196 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2022-11-02 20:21:53,044 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 3 [2022-11-02 20:21:53,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:53,044 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2022-11-02 20:21:53,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2022-11-02 20:21:53,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:21:53,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:53,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:21:53,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:21:53,046 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-02 20:21:53,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:53,047 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2022-11-02 20:21:53,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:53,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529493660] [2022-11-02 20:21:53,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:53,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:53,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:53,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529493660] [2022-11-02 20:21:53,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529493660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:53,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:53,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:21:53,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602281958] [2022-11-02 20:21:53,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:53,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:21:53,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:53,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:21:53,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:21:53,333 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:53,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:53,950 INFO L93 Difference]: Finished difference Result 354 states and 382 transitions. [2022-11-02 20:21:53,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:21:53,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-02 20:21:53,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:53,953 INFO L225 Difference]: With dead ends: 354 [2022-11-02 20:21:53,953 INFO L226 Difference]: Without dead ends: 354 [2022-11-02 20:21:53,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:21:53,955 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 279 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:53,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 232 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:21:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-11-02 20:21:53,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 190. [2022-11-02 20:21:53,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 104 states have (on average 1.9807692307692308) internal successors, (206), 189 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 206 transitions. [2022-11-02 20:21:53,982 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 206 transitions. Word has length 6 [2022-11-02 20:21:53,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:53,991 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 206 transitions. [2022-11-02 20:21:53,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 206 transitions. [2022-11-02 20:21:53,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:21:53,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:53,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:53,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:21:53,993 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-02 20:21:53,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:53,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924364, now seen corresponding path program 1 times [2022-11-02 20:21:53,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:53,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198477019] [2022-11-02 20:21:53,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:53,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:54,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:54,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:54,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198477019] [2022-11-02 20:21:54,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198477019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:54,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:54,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:21:54,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55207382] [2022-11-02 20:21:54,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:54,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:21:54,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:54,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:21:54,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:54,191 INFO L87 Difference]: Start difference. First operand 190 states and 206 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:54,482 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2022-11-02 20:21:54,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:21:54,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:21:54,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:54,483 INFO L225 Difference]: With dead ends: 189 [2022-11-02 20:21:54,483 INFO L226 Difference]: Without dead ends: 189 [2022-11-02 20:21:54,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:54,485 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 5 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:54,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 508 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:21:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-02 20:21:54,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-11-02 20:21:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 104 states have (on average 1.9711538461538463) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 205 transitions. [2022-11-02 20:21:54,494 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 205 transitions. Word has length 10 [2022-11-02 20:21:54,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:54,494 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 205 transitions. [2022-11-02 20:21:54,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2022-11-02 20:21:54,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:21:54,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:54,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:54,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:21:54,496 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-02 20:21:54,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:54,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924365, now seen corresponding path program 1 times [2022-11-02 20:21:54,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:54,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496047467] [2022-11-02 20:21:54,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:54,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:54,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:54,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496047467] [2022-11-02 20:21:54,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496047467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:54,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:54,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:21:54,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175176611] [2022-11-02 20:21:54,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:54,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:21:54,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:54,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:21:54,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:54,768 INFO L87 Difference]: Start difference. First operand 189 states and 205 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:55,068 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2022-11-02 20:21:55,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:21:55,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:21:55,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:55,070 INFO L225 Difference]: With dead ends: 188 [2022-11-02 20:21:55,070 INFO L226 Difference]: Without dead ends: 188 [2022-11-02 20:21:55,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:55,072 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 3 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:55,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 529 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:21:55,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-11-02 20:21:55,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-11-02 20:21:55,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 104 states have (on average 1.9615384615384615) internal successors, (204), 187 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2022-11-02 20:21:55,080 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 10 [2022-11-02 20:21:55,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:55,080 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2022-11-02 20:21:55,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2022-11-02 20:21:55,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:21:55,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:55,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:55,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:21:55,082 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-02 20:21:55,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:55,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596085, now seen corresponding path program 1 times [2022-11-02 20:21:55,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:55,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072223000] [2022-11-02 20:21:55,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:55,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:55,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:55,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072223000] [2022-11-02 20:21:55,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072223000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:55,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:55,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:21:55,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354100649] [2022-11-02 20:21:55,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:55,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:21:55,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:55,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:21:55,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:21:55,533 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:56,190 INFO L93 Difference]: Finished difference Result 353 states and 389 transitions. [2022-11-02 20:21:56,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:21:56,191 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 20:21:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:56,193 INFO L225 Difference]: With dead ends: 353 [2022-11-02 20:21:56,193 INFO L226 Difference]: Without dead ends: 353 [2022-11-02 20:21:56,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:21:56,195 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 470 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:56,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 675 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:21:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-11-02 20:21:56,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 192. [2022-11-02 20:21:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.9444444444444444) internal successors, (210), 191 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2022-11-02 20:21:56,216 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 15 [2022-11-02 20:21:56,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:56,217 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2022-11-02 20:21:56,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2022-11-02 20:21:56,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:21:56,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:56,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:56,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:21:56,219 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-02 20:21:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596086, now seen corresponding path program 1 times [2022-11-02 20:21:56,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:56,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297687717] [2022-11-02 20:21:56,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:56,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:56,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:56,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297687717] [2022-11-02 20:21:56,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297687717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:56,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:56,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:21:56,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711535719] [2022-11-02 20:21:56,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:56,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:21:56,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:56,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:21:56,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:21:56,655 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:57,448 INFO L93 Difference]: Finished difference Result 347 states and 383 transitions. [2022-11-02 20:21:57,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:21:57,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 20:21:57,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:57,450 INFO L225 Difference]: With dead ends: 347 [2022-11-02 20:21:57,450 INFO L226 Difference]: Without dead ends: 347 [2022-11-02 20:21:57,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:21:57,452 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 452 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:57,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 490 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:21:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-11-02 20:21:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 192. [2022-11-02 20:21:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.9351851851851851) internal successors, (209), 191 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2022-11-02 20:21:57,459 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 15 [2022-11-02 20:21:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:57,460 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2022-11-02 20:21:57,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2022-11-02 20:21:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:21:57,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:57,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:57,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:21:57,462 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-02 20:21:57,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:57,462 INFO L85 PathProgramCache]: Analyzing trace with hash 192740277, now seen corresponding path program 1 times [2022-11-02 20:21:57,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:57,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156725963] [2022-11-02 20:21:57,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:57,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:57,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:57,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156725963] [2022-11-02 20:21:57,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156725963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:57,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:57,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:21:57,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127283023] [2022-11-02 20:21:57,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:57,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:21:57,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:57,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:21:57,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:21:57,526 INFO L87 Difference]: Start difference. First operand 192 states and 209 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:57,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:57,739 INFO L93 Difference]: Finished difference Result 316 states and 348 transitions. [2022-11-02 20:21:57,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:21:57,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:21:57,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:57,741 INFO L225 Difference]: With dead ends: 316 [2022-11-02 20:21:57,741 INFO L226 Difference]: Without dead ends: 316 [2022-11-02 20:21:57,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:21:57,742 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 168 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:57,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 348 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:21:57,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-11-02 20:21:57,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 189. [2022-11-02 20:21:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 108 states have (on average 1.9074074074074074) internal successors, (206), 188 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 206 transitions. [2022-11-02 20:21:57,748 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 206 transitions. Word has length 16 [2022-11-02 20:21:57,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:57,748 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 206 transitions. [2022-11-02 20:21:57,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 206 transitions. [2022-11-02 20:21:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:21:57,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:57,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:57,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:21:57,750 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-02 20:21:57,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash 192740278, now seen corresponding path program 1 times [2022-11-02 20:21:57,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:57,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029659829] [2022-11-02 20:21:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:57,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:57,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:57,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029659829] [2022-11-02 20:21:57,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029659829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:57,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:57,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:21:57,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124454765] [2022-11-02 20:21:57,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:57,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:21:57,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:57,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:21:57,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:21:57,861 INFO L87 Difference]: Start difference. First operand 189 states and 206 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:58,066 INFO L93 Difference]: Finished difference Result 293 states and 325 transitions. [2022-11-02 20:21:58,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:21:58,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:21:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:58,069 INFO L225 Difference]: With dead ends: 293 [2022-11-02 20:21:58,069 INFO L226 Difference]: Without dead ends: 293 [2022-11-02 20:21:58,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:21:58,070 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 139 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:58,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 359 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:21:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-02 20:21:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 187. [2022-11-02 20:21:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 186 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2022-11-02 20:21:58,077 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 16 [2022-11-02 20:21:58,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:58,077 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2022-11-02 20:21:58,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2022-11-02 20:21:58,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:21:58,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:58,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:58,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:21:58,079 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-02 20:21:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809590, now seen corresponding path program 1 times [2022-11-02 20:21:58,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:58,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326889607] [2022-11-02 20:21:58,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:58,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:58,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:58,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326889607] [2022-11-02 20:21:58,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326889607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:58,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:58,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:21:58,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644654926] [2022-11-02 20:21:58,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:58,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:21:58,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:58,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:21:58,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:21:58,139 INFO L87 Difference]: Start difference. First operand 187 states and 204 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:58,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:58,448 INFO L93 Difference]: Finished difference Result 254 states and 278 transitions. [2022-11-02 20:21:58,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:21:58,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:21:58,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:58,450 INFO L225 Difference]: With dead ends: 254 [2022-11-02 20:21:58,450 INFO L226 Difference]: Without dead ends: 254 [2022-11-02 20:21:58,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:58,451 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 327 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:58,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 153 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:21:58,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-02 20:21:58,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 176. [2022-11-02 20:21:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 175 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2022-11-02 20:21:58,457 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 17 [2022-11-02 20:21:58,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:58,457 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2022-11-02 20:21:58,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:58,458 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2022-11-02 20:21:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:21:58,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:58,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:58,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:21:58,459 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-02 20:21:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809591, now seen corresponding path program 1 times [2022-11-02 20:21:58,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:58,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14733799] [2022-11-02 20:21:58,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:58,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:58,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:58,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14733799] [2022-11-02 20:21:58,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14733799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:58,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:58,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:21:58,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278707757] [2022-11-02 20:21:58,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:58,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:21:58,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:58,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:21:58,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:58,569 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:59,102 INFO L93 Difference]: Finished difference Result 438 states and 492 transitions. [2022-11-02 20:21:59,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:21:59,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:21:59,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:59,105 INFO L225 Difference]: With dead ends: 438 [2022-11-02 20:21:59,105 INFO L226 Difference]: Without dead ends: 438 [2022-11-02 20:21:59,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:59,106 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 712 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:59,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 293 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:21:59,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-11-02 20:21:59,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 318. [2022-11-02 20:21:59,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 254 states have (on average 1.7598425196850394) internal successors, (447), 317 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:59,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 447 transitions. [2022-11-02 20:21:59,118 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 447 transitions. Word has length 17 [2022-11-02 20:21:59,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:59,118 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 447 transitions. [2022-11-02 20:21:59,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 447 transitions. [2022-11-02 20:21:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:21:59,120 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:59,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:59,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:21:59,121 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-02 20:21:59,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:59,121 INFO L85 PathProgramCache]: Analyzing trace with hash -445669701, now seen corresponding path program 1 times [2022-11-02 20:21:59,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:59,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187078559] [2022-11-02 20:21:59,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:59,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:59,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:59,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187078559] [2022-11-02 20:21:59,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187078559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:59,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:59,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:21:59,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101661501] [2022-11-02 20:21:59,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:59,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:21:59,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:59,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:21:59,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:21:59,286 INFO L87 Difference]: Start difference. First operand 318 states and 447 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:00,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:00,173 INFO L93 Difference]: Finished difference Result 784 states and 1126 transitions. [2022-11-02 20:22:00,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:22:00,173 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:22:00,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:00,177 INFO L225 Difference]: With dead ends: 784 [2022-11-02 20:22:00,177 INFO L226 Difference]: Without dead ends: 784 [2022-11-02 20:22:00,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:22:00,178 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 363 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:00,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1218 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:22:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-11-02 20:22:00,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 317. [2022-11-02 20:22:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 254 states have (on average 1.7559055118110236) internal successors, (446), 316 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 446 transitions. [2022-11-02 20:22:00,198 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 446 transitions. Word has length 19 [2022-11-02 20:22:00,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:00,198 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 446 transitions. [2022-11-02 20:22:00,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 446 transitions. [2022-11-02 20:22:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:22:00,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:00,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:00,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:22:00,202 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-02 20:22:00,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:00,203 INFO L85 PathProgramCache]: Analyzing trace with hash -445669700, now seen corresponding path program 1 times [2022-11-02 20:22:00,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:00,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902046126] [2022-11-02 20:22:00,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:00,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:00,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:00,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902046126] [2022-11-02 20:22:00,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902046126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:22:00,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:22:00,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:22:00,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522325971] [2022-11-02 20:22:00,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:22:00,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:22:00,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:00,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:22:00,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:22:00,761 INFO L87 Difference]: Start difference. First operand 317 states and 446 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:01,799 INFO L93 Difference]: Finished difference Result 603 states and 842 transitions. [2022-11-02 20:22:01,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:22:01,800 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:22:01,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:01,803 INFO L225 Difference]: With dead ends: 603 [2022-11-02 20:22:01,803 INFO L226 Difference]: Without dead ends: 603 [2022-11-02 20:22:01,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:22:01,805 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 392 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:01,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 926 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:22:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-11-02 20:22:01,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 321. [2022-11-02 20:22:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 258 states have (on average 1.744186046511628) internal successors, (450), 320 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 450 transitions. [2022-11-02 20:22:01,818 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 450 transitions. Word has length 19 [2022-11-02 20:22:01,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:01,818 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 450 transitions. [2022-11-02 20:22:01,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:01,819 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 450 transitions. [2022-11-02 20:22:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:22:01,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:01,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:01,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:22:01,824 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-02 20:22:01,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:01,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1571609538, now seen corresponding path program 1 times [2022-11-02 20:22:01,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:01,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969909725] [2022-11-02 20:22:01,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:01,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:01,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:01,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969909725] [2022-11-02 20:22:01,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969909725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:22:01,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:22:01,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:22:01,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979268990] [2022-11-02 20:22:01,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:22:01,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:22:01,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:01,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:22:01,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:22:01,876 INFO L87 Difference]: Start difference. First operand 321 states and 450 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:01,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:01,901 INFO L93 Difference]: Finished difference Result 395 states and 528 transitions. [2022-11-02 20:22:01,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:22:01,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:22:01,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:01,903 INFO L225 Difference]: With dead ends: 395 [2022-11-02 20:22:01,904 INFO L226 Difference]: Without dead ends: 395 [2022-11-02 20:22:01,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:22:01,905 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 163 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:01,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 296 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:22:01,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-11-02 20:22:01,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 361. [2022-11-02 20:22:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 360 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:01,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 528 transitions. [2022-11-02 20:22:01,915 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 528 transitions. Word has length 19 [2022-11-02 20:22:01,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:01,917 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 528 transitions. [2022-11-02 20:22:01,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 528 transitions. [2022-11-02 20:22:01,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:22:01,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:01,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:01,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:22:01,923 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-02 20:22:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:01,924 INFO L85 PathProgramCache]: Analyzing trace with hash -727311539, now seen corresponding path program 1 times [2022-11-02 20:22:01,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:01,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978253470] [2022-11-02 20:22:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:01,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:02,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:02,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978253470] [2022-11-02 20:22:02,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978253470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:22:02,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:22:02,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:22:02,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355903962] [2022-11-02 20:22:02,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:22:02,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:22:02,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:02,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:22:02,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:22:02,013 INFO L87 Difference]: Start difference. First operand 361 states and 528 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:02,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:02,026 INFO L93 Difference]: Finished difference Result 365 states and 532 transitions. [2022-11-02 20:22:02,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:22:02,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 20:22:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:02,029 INFO L225 Difference]: With dead ends: 365 [2022-11-02 20:22:02,030 INFO L226 Difference]: Without dead ends: 365 [2022-11-02 20:22:02,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:22:02,031 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:02,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:22:02,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-11-02 20:22:02,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2022-11-02 20:22:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 302 states have (on average 1.7615894039735098) internal successors, (532), 364 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 532 transitions. [2022-11-02 20:22:02,041 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 532 transitions. Word has length 23 [2022-11-02 20:22:02,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:02,042 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 532 transitions. [2022-11-02 20:22:02,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 532 transitions. [2022-11-02 20:22:02,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:22:02,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:02,043 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:02,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:22:02,044 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-02 20:22:02,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:02,045 INFO L85 PathProgramCache]: Analyzing trace with hash 97933121, now seen corresponding path program 1 times [2022-11-02 20:22:02,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:02,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056073694] [2022-11-02 20:22:02,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:02,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:02,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:02,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056073694] [2022-11-02 20:22:02,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056073694] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:22:02,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160320002] [2022-11-02 20:22:02,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:02,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:22:02,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:22:02,584 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:22:02,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:22:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:02,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 20:22:02,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:22:02,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:22:02,927 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:22:02,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:22:02,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:22:03,068 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:22:03,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 26 [2022-11-02 20:22:03,128 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:22:03,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:22:03,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-11-02 20:22:03,522 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:22:03,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-11-02 20:22:03,687 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-11-02 20:22:03,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 45 [2022-11-02 20:22:03,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 13 [2022-11-02 20:22:03,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:03,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:22:04,292 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462)) (.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (or (= (select (store .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store .cse1 .cse2 v_ArrVal_463) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)) 1) (not (= (select .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select .cse0 .cse2) 1)))))) is different from false [2022-11-02 20:22:04,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:04,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 70 [2022-11-02 20:22:04,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:04,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 380 treesize of output 320 [2022-11-02 20:22:04,603 INFO L356 Elim1Store]: treesize reduction 124, result has 23.0 percent of original size [2022-11-02 20:22:04,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 851 treesize of output 821 [2022-11-02 20:22:04,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 653 treesize of output 565 [2022-11-02 20:22:04,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 577 treesize of output 449 [2022-11-02 20:22:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:13,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160320002] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:22:13,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:22:13,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 26 [2022-11-02 20:22:13,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546278389] [2022-11-02 20:22:13,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:22:13,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 20:22:13,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:13,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 20:22:13,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=526, Unknown=6, NotChecked=48, Total=702 [2022-11-02 20:22:13,937 INFO L87 Difference]: Start difference. First operand 365 states and 532 transitions. Second operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:14,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:14,553 INFO L93 Difference]: Finished difference Result 459 states and 657 transitions. [2022-11-02 20:22:14,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:22:14,554 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:22:14,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:14,556 INFO L225 Difference]: With dead ends: 459 [2022-11-02 20:22:14,556 INFO L226 Difference]: Without dead ends: 459 [2022-11-02 20:22:14,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=216, Invalid=774, Unknown=6, NotChecked=60, Total=1056 [2022-11-02 20:22:14,558 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 186 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 488 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:14,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1361 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 357 Invalid, 0 Unknown, 488 Unchecked, 0.4s Time] [2022-11-02 20:22:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-11-02 20:22:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 364. [2022-11-02 20:22:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 302 states have (on average 1.7582781456953642) internal successors, (531), 363 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 531 transitions. [2022-11-02 20:22:14,570 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 531 transitions. Word has length 24 [2022-11-02 20:22:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:14,570 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 531 transitions. [2022-11-02 20:22:14,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 531 transitions. [2022-11-02 20:22:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:22:14,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:14,572 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:14,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:22:14,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 20:22:14,799 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-02 20:22:14,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:14,799 INFO L85 PathProgramCache]: Analyzing trace with hash 97933122, now seen corresponding path program 1 times [2022-11-02 20:22:14,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:14,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302318143] [2022-11-02 20:22:14,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:14,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:16,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:16,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302318143] [2022-11-02 20:22:16,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302318143] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:22:16,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980211078] [2022-11-02 20:22:16,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:16,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:22:16,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:22:16,227 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:22:16,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15611b13-6567-461b-98df-f42d484d9f0c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:22:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:16,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-02 20:22:16,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:22:16,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:22:16,428 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:22:16,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:22:16,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:22:16,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-02 20:22:16,565 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:22:16,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 [2022-11-02 20:22:16,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:22:16,605 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:22:16,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:22:16,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 37 [2022-11-02 20:22:16,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:22:16,893 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:22:16,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 54 [2022-11-02 20:22:16,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:22:16,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:22:16,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-02 20:22:16,976 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-11-02 20:22:16,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-11-02 20:22:17,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 13 [2022-11-02 20:22:17,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-02 20:22:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:17,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:22:21,370 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (or (forall ((v_ArrVal_562 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)))) (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (or (forall ((v_ArrVal_564 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_563) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)))))) is different from false [2022-11-02 20:22:21,566 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (or (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)))) (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (or (forall ((v_ArrVal_564 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) .cse1 v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select (store .cse2 .cse1 v_ArrVal_563) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)))))) is different from false [2022-11-02 20:22:21,601 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:21,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 171 treesize of output 175 [2022-11-02 20:22:21,665 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:21,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 149 treesize of output 167 [2022-11-02 20:22:21,785 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (forall ((v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 1)) (forall ((v_prenex_2 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))))) is different from false [2022-11-02 20:22:21,806 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (forall ((v_prenex_2 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (forall ((v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 1)))) is different from false [2022-11-02 20:22:22,105 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_558 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (forall ((v_prenex_2 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558))) (= (select (select (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_2))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0)) (forall ((v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (< (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_4) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_2) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 1)))))) is different from false [2022-11-02 20:22:23,382 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:23,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 182 [2022-11-02 20:22:23,399 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:23,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 132 [2022-11-02 20:22:23,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19678 treesize of output 17590 [2022-11-02 20:22:24,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19068 treesize of output 18906 [2022-11-02 20:22:25,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18901 treesize of output 18829 [2022-11-02 20:22:25,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18829 treesize of output 18685 [2022-11-02 20:22:25,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18685 treesize of output 18621 [2022-11-02 20:22:25,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18621 treesize of output 18493 [2022-11-02 20:22:25,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18493 treesize of output 18461 [2022-11-02 20:22:25,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18461 treesize of output 18173 [2022-11-02 20:22:26,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18173 treesize of output 17997 [2022-11-02 20:22:26,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17997 treesize of output 17805 [2022-11-02 20:22:26,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17805 treesize of output 17677 [2022-11-02 20:22:26,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17677 treesize of output 17613 [2022-11-02 20:22:26,666 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:26,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 17620 treesize of output 17660 [2022-11-02 20:22:26,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17607 treesize of output 16231 [2022-11-02 20:22:27,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16231 treesize of output 14247 [2022-11-02 20:22:27,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14247 treesize of output 13735