./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/tree-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/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_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/tree-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/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_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/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 ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a --- 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:40:13,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:40:13,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:40:13,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:40:13,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:40:13,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:40:13,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:40:13,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:40:13,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:40:13,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:40:13,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:40:13,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:40:13,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:40:13,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:40:13,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:40:13,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:40:13,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:40:13,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:40:13,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:40:13,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:40:13,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:40:13,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:40:13,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:40:13,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:40:13,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:40:13,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:40:13,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:40:13,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:40:13,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:40:13,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:40:13,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:40:13,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:40:13,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:40:13,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:40:13,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:40:13,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:40:13,228 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:40:13,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:40:13,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:40:13,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:40:13,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:40:13,231 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:40:13,260 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:40:13,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:40:13,261 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:40:13,261 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:40:13,262 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:40:13,262 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:40:13,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:40:13,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:40:13,264 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:40:13,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:40:13,265 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:40:13,265 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:40:13,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:40:13,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:40:13,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:40:13,266 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:40:13,266 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:40:13,267 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:40:13,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:40:13,267 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:40:13,268 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:40:13,268 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:40:13,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:40:13,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:40:13,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:40:13,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:40:13,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:40:13,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:40:13,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:40:13,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:40:13,271 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_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/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_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/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 -> ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a [2022-11-02 20:40:13,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:40:13,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:40:13,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:40:13,619 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:40:13,620 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:40:13,621 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/heap-manipulation/tree-2.i [2022-11-02 20:40:13,718 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/data/7c0b78c78/4e5fcf89792a49bc92a54236397dbb7b/FLAGf0290d383 [2022-11-02 20:40:14,198 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:40:14,202 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/sv-benchmarks/c/heap-manipulation/tree-2.i [2022-11-02 20:40:14,215 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/data/7c0b78c78/4e5fcf89792a49bc92a54236397dbb7b/FLAGf0290d383 [2022-11-02 20:40:14,539 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/data/7c0b78c78/4e5fcf89792a49bc92a54236397dbb7b [2022-11-02 20:40:14,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:40:14,547 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:40:14,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:40:14,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:40:14,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:40:14,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:40:14" (1/1) ... [2022-11-02 20:40:14,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eadff49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:14, skipping insertion in model container [2022-11-02 20:40:14,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:40:14" (1/1) ... [2022-11-02 20:40:14,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:40:14,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:40:14,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/sv-benchmarks/c/heap-manipulation/tree-2.i[22626,22639] [2022-11-02 20:40:14,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:40:14,956 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:40:15,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/sv-benchmarks/c/heap-manipulation/tree-2.i[22626,22639] [2022-11-02 20:40:15,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:40:15,040 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:40:15,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:15 WrapperNode [2022-11-02 20:40:15,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:40:15,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:40:15,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:40:15,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:40:15,050 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:40:15" (1/1) ... [2022-11-02 20:40:15,063 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:40:15" (1/1) ... [2022-11-02 20:40:15,086 INFO L138 Inliner]: procedures = 122, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2022-11-02 20:40:15,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:40:15,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:40:15,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:40:15,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:40:15,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:15" (1/1) ... [2022-11-02 20:40:15,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:15" (1/1) ... [2022-11-02 20:40:15,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:15" (1/1) ... [2022-11-02 20:40:15,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:15" (1/1) ... [2022-11-02 20:40:15,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:15" (1/1) ... [2022-11-02 20:40:15,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:15" (1/1) ... [2022-11-02 20:40:15,144 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:15" (1/1) ... [2022-11-02 20:40:15,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:15" (1/1) ... [2022-11-02 20:40:15,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:40:15,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:40:15,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:40:15,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:40:15,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:15" (1/1) ... [2022-11-02 20:40:15,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:40:15,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:40:15,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:40:15,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:40:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:40:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-11-02 20:40:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-11-02 20:40:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:40:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:40:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:40:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:40:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:40:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:40:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:40:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:40:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:40:15,363 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:40:15,366 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:40:15,928 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:40:15,936 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:40:15,937 INFO L300 CfgBuilder]: Removed 11 assume(true) statements. [2022-11-02 20:40:15,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:40:15 BoogieIcfgContainer [2022-11-02 20:40:15,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:40:15,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:40:15,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:40:15,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:40:15,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:40:14" (1/3) ... [2022-11-02 20:40:15,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dfc9cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:40:15, skipping insertion in model container [2022-11-02 20:40:15,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:15" (2/3) ... [2022-11-02 20:40:15,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dfc9cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:40:15, skipping insertion in model container [2022-11-02 20:40:15,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:40:15" (3/3) ... [2022-11-02 20:40:15,958 INFO L112 eAbstractionObserver]: Analyzing ICFG tree-2.i [2022-11-02 20:40:15,978 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:40:15,979 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 63 error locations. [2022-11-02 20:40:16,037 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:40:16,045 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;@69947a11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:40:16,045 INFO L358 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2022-11-02 20:40:16,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 77 states have (on average 2.168831168831169) internal successors, (167), 143 states have internal predecessors, (167), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:40:16,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:40:16,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:16,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:40:16,060 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:16,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:16,072 INFO L85 PathProgramCache]: Analyzing trace with hash 31591658, now seen corresponding path program 1 times [2022-11-02 20:40:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:16,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408070563] [2022-11-02 20:40:16,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:16,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:16,255 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:40:16,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:16,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408070563] [2022-11-02 20:40:16,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408070563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:16,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:16,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:40:16,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629771860] [2022-11-02 20:40:16,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:16,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:40:16,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:16,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:40:16,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:40:16,309 INFO L87 Difference]: Start difference. First operand has 145 states, 77 states have (on average 2.168831168831169) internal successors, (167), 143 states have internal predecessors, (167), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:40:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:16,352 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2022-11-02 20:40:16,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:40:16,356 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-11-02 20:40:16,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:16,368 INFO L225 Difference]: With dead ends: 143 [2022-11-02 20:40:16,369 INFO L226 Difference]: Without dead ends: 141 [2022-11-02 20:40:16,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:40:16,375 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:16,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:40:16,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-02 20:40:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-11-02 20:40:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 139 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2022-11-02 20:40:16,450 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 5 [2022-11-02 20:40:16,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:16,451 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2022-11-02 20:40:16,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:40:16,451 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2022-11-02 20:40:16,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:40:16,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:16,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:40:16,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:40:16,453 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:16,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:16,454 INFO L85 PathProgramCache]: Analyzing trace with hash 978320808, now seen corresponding path program 1 times [2022-11-02 20:40:16,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:16,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269636563] [2022-11-02 20:40:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:16,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:16,554 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:40:16,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:16,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269636563] [2022-11-02 20:40:16,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269636563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:16,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:16,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:40:16,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454566002] [2022-11-02 20:40:16,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:16,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:16,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:16,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:16,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:16,559 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:40:16,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:16,633 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2022-11-02 20:40:16,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:16,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:40:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:16,635 INFO L225 Difference]: With dead ends: 144 [2022-11-02 20:40:16,635 INFO L226 Difference]: Without dead ends: 144 [2022-11-02 20:40:16,636 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:40:16,637 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 88 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:16,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 179 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:40:16,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-02 20:40:16,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-11-02 20:40:16,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 78 states have (on average 1.9615384615384615) internal successors, (153), 142 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:16,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2022-11-02 20:40:16,646 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 6 [2022-11-02 20:40:16,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:16,646 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2022-11-02 20:40:16,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:40:16,647 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2022-11-02 20:40:16,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:40:16,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:16,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:40:16,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:40:16,649 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:16,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:16,649 INFO L85 PathProgramCache]: Analyzing trace with hash 978321707, now seen corresponding path program 1 times [2022-11-02 20:40:16,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:16,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102601335] [2022-11-02 20:40:16,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:16,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:16,753 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:40:16,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:16,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102601335] [2022-11-02 20:40:16,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102601335] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:16,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:16,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:40:16,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287298177] [2022-11-02 20:40:16,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:16,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:16,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:16,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:16,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:16,758 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:40:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:16,998 INFO L93 Difference]: Finished difference Result 219 states and 241 transitions. [2022-11-02 20:40:16,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:16,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:40:16,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:17,004 INFO L225 Difference]: With dead ends: 219 [2022-11-02 20:40:17,004 INFO L226 Difference]: Without dead ends: 219 [2022-11-02 20:40:17,006 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:40:17,012 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 129 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:17,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 234 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:40:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-02 20:40:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 138. [2022-11-02 20:40:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 80 states have (on average 1.8625) internal successors, (149), 136 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:17,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2022-11-02 20:40:17,022 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 6 [2022-11-02 20:40:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:17,022 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2022-11-02 20:40:17,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:40:17,023 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2022-11-02 20:40:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:40:17,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:17,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:40:17,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:40:17,024 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:17,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:17,024 INFO L85 PathProgramCache]: Analyzing trace with hash 978321708, now seen corresponding path program 1 times [2022-11-02 20:40:17,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:17,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793825408] [2022-11-02 20:40:17,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:17,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,182 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:40:17,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:17,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793825408] [2022-11-02 20:40:17,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793825408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:17,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:17,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:40:17,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021863857] [2022-11-02 20:40:17,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:17,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:17,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:17,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:17,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:17,187 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:40:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:17,380 INFO L93 Difference]: Finished difference Result 240 states and 262 transitions. [2022-11-02 20:40:17,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:17,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:40:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:17,382 INFO L225 Difference]: With dead ends: 240 [2022-11-02 20:40:17,382 INFO L226 Difference]: Without dead ends: 240 [2022-11-02 20:40:17,382 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:40:17,383 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 124 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:17,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 264 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:40:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-11-02 20:40:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 150. [2022-11-02 20:40:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.768421052631579) internal successors, (168), 148 states have internal predecessors, (168), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:17,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 171 transitions. [2022-11-02 20:40:17,393 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 171 transitions. Word has length 6 [2022-11-02 20:40:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:17,393 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 171 transitions. [2022-11-02 20:40:17,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:40:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 171 transitions. [2022-11-02 20:40:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:40:17,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:17,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:17,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:40:17,395 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:17,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:17,395 INFO L85 PathProgramCache]: Analyzing trace with hash -493316198, now seen corresponding path program 1 times [2022-11-02 20:40:17,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:17,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173470546] [2022-11-02 20:40:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:17,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,419 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:40:17,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:17,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173470546] [2022-11-02 20:40:17,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173470546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:17,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:17,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:40:17,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500046012] [2022-11-02 20:40:17,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:17,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:17,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:17,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:17,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:17,422 INFO L87 Difference]: Start difference. First operand 150 states and 171 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:40:17,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:17,546 INFO L93 Difference]: Finished difference Result 229 states and 259 transitions. [2022-11-02 20:40:17,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:17,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-11-02 20:40:17,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:17,548 INFO L225 Difference]: With dead ends: 229 [2022-11-02 20:40:17,548 INFO L226 Difference]: Without dead ends: 228 [2022-11-02 20:40:17,548 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:40:17,549 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 79 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:17,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 193 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:40:17,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-02 20:40:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 153. [2022-11-02 20:40:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.7448979591836735) internal successors, (171), 151 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:17,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 174 transitions. [2022-11-02 20:40:17,569 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 174 transitions. Word has length 9 [2022-11-02 20:40:17,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:17,570 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 174 transitions. [2022-11-02 20:40:17,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:40:17,573 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2022-11-02 20:40:17,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:40:17,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:17,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:17,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:40:17,574 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:17,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:17,577 INFO L85 PathProgramCache]: Analyzing trace with hash -466102223, now seen corresponding path program 1 times [2022-11-02 20:40:17,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:17,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816429329] [2022-11-02 20:40:17,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:17,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,668 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:40:17,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:17,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816429329] [2022-11-02 20:40:17,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816429329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:17,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:17,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:40:17,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746902569] [2022-11-02 20:40:17,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:17,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:17,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:17,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:17,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:17,671 INFO L87 Difference]: Start difference. First operand 153 states and 174 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:40:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:17,692 INFO L93 Difference]: Finished difference Result 238 states and 267 transitions. [2022-11-02 20:40:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:17,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-11-02 20:40:17,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:17,694 INFO L225 Difference]: With dead ends: 238 [2022-11-02 20:40:17,695 INFO L226 Difference]: Without dead ends: 238 [2022-11-02 20:40:17,695 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:40:17,699 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 91 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:17,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 271 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:40:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-02 20:40:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 157. [2022-11-02 20:40:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 102 states have (on average 1.7156862745098038) internal successors, (175), 155 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 178 transitions. [2022-11-02 20:40:17,710 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 178 transitions. Word has length 9 [2022-11-02 20:40:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:17,710 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 178 transitions. [2022-11-02 20:40:17,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:40:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 178 transitions. [2022-11-02 20:40:17,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:40:17,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:17,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:17,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:40:17,711 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:17,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:17,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1630553122, now seen corresponding path program 1 times [2022-11-02 20:40:17,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:17,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744736930] [2022-11-02 20:40:17,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:17,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,829 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:40:17,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:17,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744736930] [2022-11-02 20:40:17,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744736930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:17,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:17,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:40:17,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757482843] [2022-11-02 20:40:17,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:17,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:40:17,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:17,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:40:17,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:40:17,833 INFO L87 Difference]: Start difference. First operand 157 states and 178 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:17,898 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2022-11-02 20:40:17,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:40:17,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-02 20:40:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:17,900 INFO L225 Difference]: With dead ends: 162 [2022-11-02 20:40:17,900 INFO L226 Difference]: Without dead ends: 158 [2022-11-02 20:40:17,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:40:17,903 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 11 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:17,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 538 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:40:17,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-02 20:40:17,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 153. [2022-11-02 20:40:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.7346938775510203) internal successors, (170), 151 states have internal predecessors, (170), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 173 transitions. [2022-11-02 20:40:17,915 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 173 transitions. Word has length 11 [2022-11-02 20:40:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:17,916 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 173 transitions. [2022-11-02 20:40:17,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 173 transitions. [2022-11-02 20:40:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:40:17,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:17,918 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:17,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:40:17,919 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:17,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash 543499593, now seen corresponding path program 1 times [2022-11-02 20:40:17,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:17,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519779047] [2022-11-02 20:40:17,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:17,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:17,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:17,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519779047] [2022-11-02 20:40:17,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519779047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:17,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:17,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:40:17,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095127916] [2022-11-02 20:40:17,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:17,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:17,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:17,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:17,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:17,971 INFO L87 Difference]: Start difference. First operand 153 states and 173 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:40:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:18,024 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2022-11-02 20:40:18,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:18,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-11-02 20:40:18,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:18,026 INFO L225 Difference]: With dead ends: 162 [2022-11-02 20:40:18,026 INFO L226 Difference]: Without dead ends: 162 [2022-11-02 20:40:18,027 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:40:18,027 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 29 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:18,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 237 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:40:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-02 20:40:18,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2022-11-02 20:40:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.7244897959183674) internal successors, (169), 151 states have internal predecessors, (169), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:18,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2022-11-02 20:40:18,032 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 18 [2022-11-02 20:40:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:18,033 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2022-11-02 20:40:18,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:40:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2022-11-02 20:40:18,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:40:18,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:18,034 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:18,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:40:18,035 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:18,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:18,035 INFO L85 PathProgramCache]: Analyzing trace with hash 570713568, now seen corresponding path program 1 times [2022-11-02 20:40:18,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:18,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959183865] [2022-11-02 20:40:18,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:18,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:18,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:18,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959183865] [2022-11-02 20:40:18,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959183865] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:40:18,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669230909] [2022-11-02 20:40:18,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:18,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:40:18,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:40:18,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:40:18,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:40:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:18,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:40:18,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:40:18,413 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:40:18,468 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:40:18,468 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:40:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:18,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:40:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:18,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669230909] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:40:18,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:40:18,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-02 20:40:18,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505952159] [2022-11-02 20:40:18,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:40:18,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:40:18,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:18,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:40:18,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:40:18,636 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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:40:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:18,775 INFO L93 Difference]: Finished difference Result 195 states and 216 transitions. [2022-11-02 20:40:18,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:40:18,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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 18 [2022-11-02 20:40:18,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:18,777 INFO L225 Difference]: With dead ends: 195 [2022-11-02 20:40:18,777 INFO L226 Difference]: Without dead ends: 195 [2022-11-02 20:40:18,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:40:18,778 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 386 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:18,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 208 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 94 Unchecked, 0.1s Time] [2022-11-02 20:40:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-02 20:40:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 152. [2022-11-02 20:40:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 98 states have (on average 1.7142857142857142) internal successors, (168), 150 states have internal predecessors, (168), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 171 transitions. [2022-11-02 20:40:18,783 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 171 transitions. Word has length 18 [2022-11-02 20:40:18,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:18,783 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 171 transitions. [2022-11-02 20:40:18,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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:40:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 171 transitions. [2022-11-02 20:40:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:40:18,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:18,785 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:18,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:40:19,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:40:19,007 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:19,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:19,008 INFO L85 PathProgramCache]: Analyzing trace with hash 570713569, now seen corresponding path program 1 times [2022-11-02 20:40:19,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:19,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224472277] [2022-11-02 20:40:19,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:19,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:19,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:19,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224472277] [2022-11-02 20:40:19,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224472277] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:40:19,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734943440] [2022-11-02 20:40:19,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:19,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:40:19,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:40:19,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:40:19,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:40:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:19,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 20:40:19,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:40:19,480 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:40:19,487 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:40:19,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:40:19,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:40:19,619 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:40:19,620 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:40:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:19,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:40:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:20,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734943440] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:40:20,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:40:20,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-11-02 20:40:20,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361057604] [2022-11-02 20:40:20,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:40:20,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:40:20,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:20,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:40:20,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:40:20,014 INFO L87 Difference]: Start difference. First operand 152 states and 171 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 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:40:20,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:20,348 INFO L93 Difference]: Finished difference Result 203 states and 216 transitions. [2022-11-02 20:40:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:40:20,349 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 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 18 [2022-11-02 20:40:20,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:20,350 INFO L225 Difference]: With dead ends: 203 [2022-11-02 20:40:20,350 INFO L226 Difference]: Without dead ends: 203 [2022-11-02 20:40:20,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:40:20,351 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 273 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:20,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 264 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 305 Invalid, 0 Unknown, 136 Unchecked, 0.3s Time] [2022-11-02 20:40:20,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-02 20:40:20,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 151. [2022-11-02 20:40:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 98 states have (on average 1.7040816326530612) internal successors, (167), 149 states have internal predecessors, (167), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:20,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 170 transitions. [2022-11-02 20:40:20,355 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 170 transitions. Word has length 18 [2022-11-02 20:40:20,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:20,356 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 170 transitions. [2022-11-02 20:40:20,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 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:40:20,356 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 170 transitions. [2022-11-02 20:40:20,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:40:20,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:20,357 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:20,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:40:20,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:40:20,575 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:20,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:20,575 INFO L85 PathProgramCache]: Analyzing trace with hash -317039615, now seen corresponding path program 1 times [2022-11-02 20:40:20,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:20,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889529862] [2022-11-02 20:40:20,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:20,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:40:20,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:20,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889529862] [2022-11-02 20:40:20,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889529862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:20,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:20,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:40:20,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570041601] [2022-11-02 20:40:20,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:20,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:40:20,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:20,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:40:20,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:40:20,718 INFO L87 Difference]: Start difference. First operand 151 states and 170 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:40:20,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:20,874 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2022-11-02 20:40:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:40:20,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:40:20,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:20,876 INFO L225 Difference]: With dead ends: 150 [2022-11-02 20:40:20,876 INFO L226 Difference]: Without dead ends: 150 [2022-11-02 20:40:20,877 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:40:20,877 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 7 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:20,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 364 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:40:20,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-02 20:40:20,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-02 20:40:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 98 states have (on average 1.683673469387755) internal successors, (165), 148 states have internal predecessors, (165), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:20,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 168 transitions. [2022-11-02 20:40:20,882 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 168 transitions. Word has length 19 [2022-11-02 20:40:20,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:20,882 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 168 transitions. [2022-11-02 20:40:20,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:40:20,883 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 168 transitions. [2022-11-02 20:40:20,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:40:20,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:20,883 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:20,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:40:20,884 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:20,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:20,884 INFO L85 PathProgramCache]: Analyzing trace with hash -317039614, now seen corresponding path program 1 times [2022-11-02 20:40:20,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:20,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101521430] [2022-11-02 20:40:20,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:20,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:40:21,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:21,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101521430] [2022-11-02 20:40:21,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101521430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:21,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:21,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:40:21,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454720454] [2022-11-02 20:40:21,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:21,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:40:21,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:21,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:40:21,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:40:21,069 INFO L87 Difference]: Start difference. First operand 150 states and 168 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:40:21,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:21,250 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2022-11-02 20:40:21,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:40:21,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:40:21,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:21,252 INFO L225 Difference]: With dead ends: 149 [2022-11-02 20:40:21,252 INFO L226 Difference]: Without dead ends: 149 [2022-11-02 20:40:21,253 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:40:21,253 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 5 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:21,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 377 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:40:21,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-02 20:40:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-02 20:40:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.663265306122449) internal successors, (163), 147 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions. [2022-11-02 20:40:21,258 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 19 [2022-11-02 20:40:21,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:21,259 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions. [2022-11-02 20:40:21,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:40:21,259 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions. [2022-11-02 20:40:21,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:40:21,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:21,267 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:21,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:40:21,269 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash -294047799, now seen corresponding path program 1 times [2022-11-02 20:40:21,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:21,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741451602] [2022-11-02 20:40:21,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:21,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:21,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:21,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741451602] [2022-11-02 20:40:21,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741451602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:21,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:21,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:40:21,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297523092] [2022-11-02 20:40:21,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:21,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:40:21,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:21,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:40:21,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:40:21,573 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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:40:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:21,949 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2022-11-02 20:40:21,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:40:21,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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 22 [2022-11-02 20:40:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:21,950 INFO L225 Difference]: With dead ends: 150 [2022-11-02 20:40:21,950 INFO L226 Difference]: Without dead ends: 150 [2022-11-02 20:40:21,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 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:40:21,951 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 44 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:21,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 539 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:40:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-02 20:40:21,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-11-02 20:40:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.653061224489796) internal successors, (162), 147 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 165 transitions. [2022-11-02 20:40:21,955 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 165 transitions. Word has length 22 [2022-11-02 20:40:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:21,956 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 165 transitions. [2022-11-02 20:40:21,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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:40:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2022-11-02 20:40:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:40:21,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:21,956 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:21,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:40:21,957 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:21,957 INFO L85 PathProgramCache]: Analyzing trace with hash -294047798, now seen corresponding path program 1 times [2022-11-02 20:40:21,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:21,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047102159] [2022-11-02 20:40:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:21,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:22,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:22,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047102159] [2022-11-02 20:40:22,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047102159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:22,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:22,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:40:22,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111311299] [2022-11-02 20:40:22,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:22,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:40:22,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:22,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:40:22,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:40:22,358 INFO L87 Difference]: Start difference. First operand 149 states and 165 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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:40:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:22,731 INFO L93 Difference]: Finished difference Result 149 states and 164 transitions. [2022-11-02 20:40:22,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:40:22,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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 22 [2022-11-02 20:40:22,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:22,732 INFO L225 Difference]: With dead ends: 149 [2022-11-02 20:40:22,732 INFO L226 Difference]: Without dead ends: 149 [2022-11-02 20:40:22,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 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:40:22,733 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 42 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:22,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 487 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:40:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-02 20:40:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-02 20:40:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.6428571428571428) internal successors, (161), 147 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2022-11-02 20:40:22,737 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 22 [2022-11-02 20:40:22,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:22,737 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2022-11-02 20:40:22,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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:40:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2022-11-02 20:40:22,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:40:22,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:22,738 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:22,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:40:22,738 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:22,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:22,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1755349544, now seen corresponding path program 1 times [2022-11-02 20:40:22,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:22,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672149045] [2022-11-02 20:40:22,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:22,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:23,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:23,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672149045] [2022-11-02 20:40:23,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672149045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:23,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:23,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:40:23,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583059680] [2022-11-02 20:40:23,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:23,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:40:23,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:23,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:40:23,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:40:23,026 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 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:40:23,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:23,455 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2022-11-02 20:40:23,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:40:23,455 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 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 25 [2022-11-02 20:40:23,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:23,456 INFO L225 Difference]: With dead ends: 150 [2022-11-02 20:40:23,456 INFO L226 Difference]: Without dead ends: 150 [2022-11-02 20:40:23,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:40:23,457 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 48 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:23,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 610 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:40:23,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-02 20:40:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-11-02 20:40:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.6326530612244898) internal successors, (160), 147 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2022-11-02 20:40:23,461 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 25 [2022-11-02 20:40:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:23,461 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2022-11-02 20:40:23,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 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:40:23,462 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2022-11-02 20:40:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:40:23,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:23,462 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:23,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:40:23,463 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:23,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:23,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1755349545, now seen corresponding path program 1 times [2022-11-02 20:40:23,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:23,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607211013] [2022-11-02 20:40:23,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:23,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:23,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607211013] [2022-11-02 20:40:23,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607211013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:23,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:23,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:40:23,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402506147] [2022-11-02 20:40:23,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:23,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:40:23,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:23,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:40:23,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:40:23,904 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 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:40:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:24,466 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2022-11-02 20:40:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:40:24,467 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 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 25 [2022-11-02 20:40:24,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:24,467 INFO L225 Difference]: With dead ends: 149 [2022-11-02 20:40:24,468 INFO L226 Difference]: Without dead ends: 149 [2022-11-02 20:40:24,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:40:24,468 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 46 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:24,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 640 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:40:24,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-02 20:40:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-02 20:40:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.6224489795918366) internal successors, (159), 147 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2022-11-02 20:40:24,472 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 25 [2022-11-02 20:40:24,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:24,473 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2022-11-02 20:40:24,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 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:40:24,473 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2022-11-02 20:40:24,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:40:24,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:24,473 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:24,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:40:24,474 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:24,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:24,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1903478128, now seen corresponding path program 1 times [2022-11-02 20:40:24,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:24,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163970094] [2022-11-02 20:40:24,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:24,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:24,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:24,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163970094] [2022-11-02 20:40:24,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163970094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:24,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:24,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:40:24,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938734964] [2022-11-02 20:40:24,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:24,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:40:24,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:24,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:40:24,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:40:24,845 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:25,247 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2022-11-02 20:40:25,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:40:25,248 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:40:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:25,249 INFO L225 Difference]: With dead ends: 151 [2022-11-02 20:40:25,249 INFO L226 Difference]: Without dead ends: 151 [2022-11-02 20:40:25,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:40:25,250 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 61 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:25,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 539 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:40:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-02 20:40:25,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2022-11-02 20:40:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.6122448979591837) internal successors, (158), 147 states have internal predecessors, (158), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2022-11-02 20:40:25,254 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 28 [2022-11-02 20:40:25,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:25,254 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2022-11-02 20:40:25,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:25,254 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-11-02 20:40:25,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:40:25,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:25,255 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:25,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:40:25,255 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:25,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:25,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1903478127, now seen corresponding path program 1 times [2022-11-02 20:40:25,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:25,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747109631] [2022-11-02 20:40:25,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:25,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:25,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:25,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747109631] [2022-11-02 20:40:25,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747109631] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:25,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:25,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:40:25,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460305970] [2022-11-02 20:40:25,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:25,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:40:25,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:25,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:40:25,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:40:25,774 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:26,253 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-11-02 20:40:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:40:26,254 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:40:26,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:26,255 INFO L225 Difference]: With dead ends: 149 [2022-11-02 20:40:26,255 INFO L226 Difference]: Without dead ends: 149 [2022-11-02 20:40:26,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:40:26,256 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 50 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:26,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 643 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:40:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-02 20:40:26,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-02 20:40:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.6020408163265305) internal successors, (157), 147 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2022-11-02 20:40:26,260 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 28 [2022-11-02 20:40:26,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:26,261 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2022-11-02 20:40:26,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:40:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2022-11-02 20:40:26,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:40:26,262 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:26,262 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:26,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:40:26,263 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-11-02 20:40:26,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:26,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1030942896, now seen corresponding path program 1 times [2022-11-02 20:40:26,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:26,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723279838] [2022-11-02 20:40:26,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:26,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:27,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:27,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:27,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723279838] [2022-11-02 20:40:27,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723279838] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:40:27,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140222397] [2022-11-02 20:40:27,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:27,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:40:27,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:40:27,075 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:40:27,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5ae87cc-3c64-4d73-94f5-4910122d3f0b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:40:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:27,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-02 20:40:27,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:40:27,259 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:40:27,294 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:40:27,300 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:40:27,339 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:40:27,347 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 23 treesize of output 22 [2022-11-02 20:40:27,398 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:40:27,399 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:40:27,413 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:40:27,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:40:27,477 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:40:27,478 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 38 treesize of output 37 [2022-11-02 20:40:27,494 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 20 treesize of output 22 [2022-11-02 20:40:27,561 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:40:27,562 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 38 treesize of output 37 [2022-11-02 20:40:27,576 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 20 treesize of output 22 [2022-11-02 20:40:27,645 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:40:27,645 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 38 treesize of output 37 [2022-11-02 20:40:27,653 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 20 treesize of output 22 [2022-11-02 20:40:27,742 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:40:27,742 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 38 treesize of output 37 [2022-11-02 20:40:27,753 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 20 treesize of output 22 [2022-11-02 20:40:27,779 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 19 treesize of output 7 [2022-11-02 20:40:27,785 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:40:27,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2022-11-02 20:40:27,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:27,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:40:27,818 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_607 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_607) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_608 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_608) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)))) is different from false [2022-11-02 20:40:27,830 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_607 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_607) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_608 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_608) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse1) 0)))) is different from false [2022-11-02 20:40:27,854 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_606))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_608)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_605) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_606) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_607) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse1) 0)))) is different from false [2022-11-02 20:40:27,870 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_606))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_608)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_605) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_606) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_607) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse2) 0)))) is different from false [2022-11-02 20:40:27,897 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_604))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_603) .cse0 v_ArrVal_605) (select (select (store .cse1 .cse0 v_ArrVal_606) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_607))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_604 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_604))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_606)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_608)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse2) 0)))) is different from false [2022-11-02 20:40:27,918 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_604))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_603) .cse1 v_ArrVal_605) (select (select (store .cse2 .cse1 v_ArrVal_606) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_607))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_604 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_604))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_606)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_608)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse3) 0)))) is different from false [2022-11-02 20:40:27,951 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_601))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse2 (store .cse3 .cse0 v_ArrVal_604))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_602) .cse0 v_ArrVal_603) .cse1 v_ArrVal_605) (select (select (store .cse2 .cse1 v_ArrVal_606) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_607))))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (= (select (select (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_601))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_604)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_606)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_608)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse4) 0)))) is different from false [2022-11-02 20:40:27,971 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_601))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse3 (store .cse4 .cse1 v_ArrVal_604))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_602) .cse1 v_ArrVal_603) .cse2 v_ArrVal_605) (select (select (store .cse3 .cse2 v_ArrVal_606) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_607))))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_601))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_604)))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_606)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_608)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse5) 0)))) is different from false [2022-11-02 20:40:28,019 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset| |c_ULTIMATE.start_create_tree_#t~malloc11#1.base|))) (.cse5 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_598 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (let ((.cse3 (store .cse4 |c_ULTIMATE.start_create_tree_#t~malloc11#1.base| v_ArrVal_601))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse2 (store .cse3 .cse0 v_ArrVal_604))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_~node~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset| v_ArrVal_598)) |c_ULTIMATE.start_create_tree_#t~malloc11#1.base| v_ArrVal_602) .cse0 v_ArrVal_603) .cse1 v_ArrVal_605) (select (select (store .cse2 .cse1 v_ArrVal_606) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_607))))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (let ((.cse8 (store .cse4 |c_ULTIMATE.start_create_tree_#t~malloc11#1.base| v_ArrVal_601))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_604)))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_606)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_608)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse5) 0)))) is different from false [2022-11-02 20:40:30,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:40:30,332 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 3 case distinctions, treesize of input 226 treesize of output 111 [2022-11-02 20:40:30,389 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:40:30,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1231184 treesize of output 982190 [2022-11-02 20:41:25,972 WARN L234 SmtUtils]: Spent 55.58s on a formula simplification. DAG size of input: 486 DAG size of output: 459 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:41:28,633 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:41:28,634 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 721430 treesize of output 687626 [2022-11-02 20:41:31,483 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:41:31,487 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 687626 treesize of output 612538 [2022-11-02 20:41:34,117 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:41:34,118 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 612538 treesize of output 559166 [2022-11-02 20:41:36,778 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 559166 treesize of output 557118 [2022-11-02 20:44:23,951 WARN L234 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 293 DAG size of output: 293 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)